A new fast modular arithmetic method in public key cryptography

DOI10.1007/BF02831841zbMATH Open1131.94322OpenAlexW1896325506MaRDI QIDQ3443246FDOQ3443246

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

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

zbMATH Keywords

public key cryptographymodular arithmeticmodular exponentiationmodular multiplication

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• New frameworks for Montgomery’s modular multiplication method
• Title not available (Why is that?)
• Title not available (Why is that?)

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)