Efficient modular reduction algorithm without correction phase

DOI10.1007/978-3-319-19647-3_28MaRDI QIDQ3452578zbMATH OpenOpenAlexFDO

Authors Guo Qiang Bai, Huikang Hao, Haibo 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)

Recommendations

• Modular Reduction in GF(2 n ) without Pre-computational Phase
• An improvement of the Barrett modular reduction algorithm
• Efficient modular reduction algorithm in \(\mathbb F_q[x]\) and its application to ``left to right modular multiplication in \(\mathbb F_2[x]\).
• Fast direct computation of modular reduction
• Subtraction-free almost Montgomery inverse algorithm

Cites work

• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• scientific article; zbMATH DE number 1759292 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• Efficient and formally proven reduction of large integers by small moduli
• Elliptic Curve Cryptosystems
• Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods
• New directions in cryptography
• Speeding up bipartite modular multiplication

Cited in

(3)

• Accelerated evaluation of modular reduction
• Modular Reduction in GF(2 n ) without Pre-computational Phase
• An improvement of the Barrett modular reduction algorithm

This page was built for publication: Efficient modular reduction algorithm without correction phase

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