High-throughput low-complexity systolic montgomery multiplication over GF(2m) Based on Trinomials

Bayat Sarmadi, S ; Sharif University of Technology | 2015

427 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/TCSII.2014.2387681
  3. Publisher: Institute of Electrical and Electronics Engineers Inc , 2015
  4. Abstract:
  5. Cryptographic computation exploits finite field arithmetic and, in particular, multiplication. Lightweight and fast implementations of such arithmetic are necessary for many sensitive applications. This brief proposed a low-complexity systolic Montgomery multiplication over GF(2m). Our complexity analysis shows that the area complexity of the proposed architecture is reduced compared with the previous work. This has also been confirmed through our application-specific integrated circuit area and time equivalent estimations and implementations. Hence, the proposed architecture appears to be very well suited for high-throughput low-complexity cryptographic applications
  6. Keywords:
  7. Lightweight and high throughput cryptographic architectures ; Application specific integrated circuits ; Cryptography ; Cryptographic applications ; Cryptographic architecture ; Cryptographic computations ; Finite field arithmetic ; Finite fields ; Montgomery multiplication ; Proposed architectures ; trinomials ; Throughput
  8. Source: IEEE Transactions on Circuits and Systems II: Express Briefs ; Volume 62, Issue 4 , January , 2015 , Pages 377-381 ; 15497747 (ISSN)
  9. URL: http://ieeexplore.ieee.org/document/7001186