A new fast modular arithmetic method in public key cryptography

DOI10.1007/BF02831841MaRDI QIDQ3443246zbMATH OpenOpenAlexFDO

Authors Bangju Wang, Huanguo Zhang

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

public key cryptographymodular arithmeticmodular exponentiationmodular multiplication

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2118995
• scientific article; zbMATH DE number 2104055
• New modular multiplication algorithms for fast modular exponentiation
• scientific article; zbMATH DE number 1294069
• scientific article; zbMATH DE number 1953319

Cites work

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

Cited in

(4)

• scientific article; zbMATH DE number 5787842 (Why is no real title available?)
• scientific article; zbMATH DE number 1839433 (Why is no real title available?)
• scientific article; zbMATH DE number 1759646 (Why is no real title available?)
• New frameworks for Montgomery’s modular multiplication method

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3443246)