Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation

DOI10.1007/978-3-540-70500-0_34MaRDI QIDQ3511182zbMATH OpenOpenAlexFDO

Authors Christophe Negre, Thomas Plantard

Publication date 8 July 2008

Published in Information Security and Privacy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70500-0_34

zbMATH Keywords

prime fieldmodular multiplicationLagrange representationmodular number system

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Mathematical problems of computer architecture (68M07)

Recommendations

• Selected Areas in Cryptography
• scientific article; zbMATH DE number 1955798
• A faster modular multiplication algorithm
• Efficient multiplication over extension fields
• Efficient modular reduction algorithm in \(\mathbb F_q[x]\) and its application to ``left to right modular multiplication in \(\mathbb F_2[x]\).

Cites work

• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 3945341 (Why is no real title available?)
• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• scientific article; zbMATH DE number 1936673 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• An RNS Montgomery modular multiplication algorithm
• Elliptic Curve Cryptosystems
• Factoring polynomials with rational coefficients
• Fast LLL-type lattice reduction
• Fast multiplication of large numbers
• Minkowski's Convex Body Theorem and Integer Programming
• Modular Multiplication Without Trial Division
• New directions in cryptography
• On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis
• Selected Areas in Cryptography

Cited in

(8)

• On polynomial modular number systems over \(\mathbb{Z}/p\mathbb{Z}\)
• Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography
• Modular multiplication in the AMNS representation: hardware implementation
• Finite field arithmetic in large characteristic for classical and post-quantum cryptography
• An alternative approach for SIDH arithmetic
• PMNS arithmetic for elliptic curve cryptography
• Complexity of computation in finite fields
• PMNS for cryptography: a guided tour

This page was built for publication: Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation

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