Speeding up bipartite modular multiplication

Authors:
Miroslav Knežević;Frederik Vercauteren;Ingrid Verbauwhede
Affiliations:
Katholieke Universiteit Leuven, Department of Electrical Engineering, ESAT, SCD-COSIC and IBBT, Leuven-Heverlee, Belgium;Katholieke Universiteit Leuven, Department of Electrical Engineering, ESAT, SCD-COSIC and IBBT, Leuven-Heverlee, Belgium;Katholieke Universiteit Leuven, Department of Electrical Engineering, ESAT, SCD-COSIC and IBBT, Leuven-Heverlee, Belgium
Venue:
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Year:
2010

Citing 9
Cited 1

Efficient factoring based on partial information

Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor

Proceedings on Advances in cryptology---CRYPTO '86
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Factoring N = prq for Large r

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Generating RSA Moduli with a Predetermined Portion

ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Finding a small root of a bivariate integer equation; factoring with high bits known

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
RSA moduli with a predetermined portion: techniques and applications

ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
Bipartite modular multiplication

CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems

High-Performance scalar multiplication using 8-dimensional GLV/GLS decomposition

CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A large set of moduli, for which the speed of bipartite modular multiplication considerably increases, is proposed in this work. By considering state of the art attacks on public-key cryptosystems, we show that the proposed set is safe to use in practice for both elliptic curve cryptography and RSA cryptosystems. We propose a hardware architecture for the modular multiplier that is based on our method. The results show that, concerning the speed, our proposed architecture outperforms the modular multiplier based on standard bipartite modular multiplication. Additionally, our design consumes less area compared to the standard solutions.