Proceedings on Advances in cryptology---CRYPTO '86
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Low-Weight Polynomial Form Integers for Efficient Modular Multiplication
IEEE Transactions on Computers
Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Efficient lattice-based signature scheme
International Journal of Applied Cryptography
A digital signature scheme based on CV P∞
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Efficient multiplication over extension fields
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
| Hi-index | 0.00 |
In SAC 2003, J. Chung and A. Hasan introduced a new class of specific moduli for cryptography, called the more generalized Mersenne numbers, in reference to J. Solinas' generalized Mersenne numbers proposed in 1999. This paper pursues the quest. The main idea is a new representation, called Modular Number System (MNS), which allows efficient implementation of the modular arithmetic operations required in cryptography. We propose a modular multiplication which only requires n2 multiplications and 3(2n2 – n + 1) additions, where n is the size (in words) of the operands. Our solution is thus more efficient than Montgomery for a very large class of numbers that do not belong to the large Mersenne family.