Modular Reduction in GF(2 n ) without Pre-computational Phase

DOI10.1007/978-3-540-69499-1_7MaRDI QIDQ3519553zbMATH OpenOpenAlexFDO

Authors Miroslav Knežević, K. Sakiyama, Junfeng Fan, Ingrid Verbauwhede

Publication date 19 August 2008

Published in Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69499-1_7

zbMATH Keywords

Barrett reductionelliptic curve cryptographymodular multiplicationMontgomery reductionpublic-key cryptography

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• Faster Montgomery modular multiplication without pre-computational phase for some classes of finite fields
• Efficient modular reduction algorithm in \(\mathbb F_q[x]\) and its application to ``left to right modular multiplication in \(\mathbb F_2[x]\).
• Efficient modular reduction algorithm without correction phase
• Fast direct computation of modular reduction
• Semi-systolic Modular Multiplier over GF(2m)

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Efficient modular reduction algorithm in \(\mathbb F_q[x]\) and its application to ``left to right modular multiplication in \(\mathbb F_2[x]\).
• Elliptic Curve Cryptosystems
• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• Modular Multiplication Without Trial Division
• Montgomery multiplication in \(\text{GF}(2^ k)\)
• New directions in cryptography

Cited in

(5)

• Fast modular reduction and squaring in \(\mathrm{GF}(2^m)\)
• Efficient modular reduction algorithm without correction phase
• An efficient RSA implementation without precomputation
• Faster Montgomery modular multiplication without pre-computational phase for some classes of finite fields
• Efficient modular reduction algorithm in \(\mathbb F_q[x]\) and its application to ``left to right modular multiplication in \(\mathbb F_2[x]\).

This page was built for publication: Modular Reduction in GF(2 n ) without Pre-computational Phase

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