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

DOI10.1007/978-90-481-9794-1_75zbMath1202.68162OpenAlexW2172493168MaRDI QIDQ4932751

Murat Cenk, Sedat Akleylek, Ferruh Özbudak

Publication date: 6 October 2010

Published in: Lecture Notes in Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-90-481-9794-1_75

zbMATH Keywords

public key cryptographyVLSI implementationelliptic curve cryptographyMontgomery modular multiplication

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Applications to coding theory and cryptography of arithmetic geometry (14G50) Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Montgomery multiplication in \(\text{GF}(2^ k)\)
• Modular Multiplication Without Trial Division
• Modular Reduction in GF(2 n ) without Pre-computational Phase
• Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods