Efficient Modular Reduction Algorithm Without Correction Phase

DOI10.1007/978-3-319-19647-3_28zbMath1408.94971OpenAlexW2399193232MaRDI QIDQ3452578

Huikang Hao, Guoqiang Bai, Hai-Bo Yu

Publication date: 12 November 2015

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19647-3_28

zbMATH Keywords

public-key cryptographymodular reductionBarrett algorithmcorrection phasehigh-speed hardware implementation

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient and formally proven reduction of large integers by small moduli
• Speeding Up Bipartite Modular Multiplication
• Elliptic Curve Cryptosystems
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods

This page was built for publication: Efficient Modular Reduction Algorithm Without Correction Phase