个性化文献订阅>期刊> IEEE Transactions on Computers
 

Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity

  作者 Akleylek, S; Ozbudak, F  
  选自 期刊  IEEE Transactions on Computers;  卷期  2012年61-3;  页码  427-432  
  关联知识点  
 

[摘要]We give a modified redundant representation for designing arithmetic circuits with small complexity. Using our modified redundant representation, we improve many of the complexity values significantly. Our method works for any finite field. We also give some applications in cryptography.

 
      被申请数(0)  
 

[全文传递流程]

一般上传文献全文的时限在1个工作日内