A new fast modular arithmetic method in public key cryptography

DOI10.1007/BF02831841zbMath1131.94322OpenAlexW1896325506MaRDI QIDQ3443246

Huanguo Zhang, Bangju Wang

Publication date: 1 June 2007

Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02831841

zbMATH Keywords

modular exponentiationpublic key cryptographymodular arithmeticmodular multiplication

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Cites Work

• A new RSA cryptosystem hardware design based on Montgomery's algorithm
• Modular Multiplication Without Trial Division
• Cryptanalysis of short RSA secret exponents
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems

This page was built for publication: A new fast modular arithmetic method in public key cryptography