Efficient Modular Reduction Algorithm in $$ \mathbb{F}_q $$ [x] and Its Application to “Left to Right” Modular Multiplication in $$ \mathbb{F}_2 $$ [x]

DOI10.1007/978-3-540-45238-6_17zbMath1274.11174OpenAlexW2223160607MaRDI QIDQ5187956

Jean-François Dhem

Publication date: 9 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-45238-6_17

zbMATH Keywords

elliptic curvescryptographysmart cardmodular multiplicationECDSAMontgomeryBarrettmultiplications in \(\mathbb F_2[x\)]multiply and add without carriesquotient evaluation

Mathematics Subject Classification ID

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

Related Items (2)

Modular Reduction in GF(2 n ) without Pre-computational Phase ⋮ Higher-Order Masking in Practice: A Vector Implementation of Masked AES for ARM NEON

This page was built for publication: Efficient Modular Reduction Algorithm in $$ \mathbb{F}_q $$ [x] and Its Application to “Left to Right” Modular Multiplication in $$ \mathbb{F}_2 $$ [x]