Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation

DOI10.1007/978-3-540-70500-0_34zbMath1279.94107OpenAlexW1576555092MaRDI QIDQ3511182

Thomas Plantard, Christophe Negre

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

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

Related Items

Complexity of computation in finite fields, Finite field arithmetic in large characteristic for classical and post-quantum cryptography, Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography, An alternative approach for SIDH arithmetic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Fast LLL-type lattice reduction
• Fast multiplication of large numbers
• Modular Multiplication Without Trial Division
• Elliptic Curve Cryptosystems
• Minkowski's Convex Body Theorem and Integer Programming
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis
• An RNS Montgomery modular multiplication algorithm
• Selected Areas in Cryptography