Montgomery Multiplication in GF(2^k
Designs, Codes and Cryptography
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
NTRU: A Ring-Based Public Key Cryptosystem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Privacy-aware multi-context RFID infrastructure using public key cryptography
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
A high-performance unified-field reconfigurable cryptographic processor
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A non-associative lattice-based public key cryptosystem
Security and Communication Networks
| Hi-index | 14.98 |
In this paper, we propose a new unified architecture that utilizes the Montgomery Multiplication algorithm to perform a modular multiplication for both integers and binary polynomials and NTRU's polynomial multiplications. The unified design is capable of supporting a majority of public-key cryptosystems such as NTRU, RSA, Diffie-Hellman key exchange, and Elliptic Curve schemes, among others. Furthermore, the architecture is highly efficient in terms of area and speed.