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

DOI10.1007/978-3-540-69499-1_7zbMath1247.94027OpenAlexW1558771847MaRDI QIDQ3519553

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

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

public-key cryptographyelliptic curve cryptographymodular multiplicationBarrett reductionMontgomery reduction

Mathematics Subject Classification ID

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

Related Items (1)

Faster Montgomery Modular Multiplication without Pre-computational Phase For Some Classes of Finite Fields

Cites Work

• Unnamed Item
• Montgomery multiplication in \(\text{GF}(2^ k)\)
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Modular Multiplication Without Trial Division
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Elliptic Curve Cryptosystems
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• 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