Modular multiplication in the AMNS representation: hardware implementation

DOI10.1007/978-3-031-82841-6_11MaRDI QIDQ6970665zbMATH OpenFDO

Authors Louis Noyez, Nadia El Mrabet, Olivier Potin, Pascal Véron

Publication date 17 June 2025

zbMATH Keywords

hardware implementationMontgomery multiplicationAMNS

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• scientific article; zbMATH DE number 177038 (Why is no real title available?)
• scientific article; zbMATH DE number 1504803 (Why is no real title available?)
• scientific article; zbMATH DE number 1878333 (Why is no real title available?)
• scientific article; zbMATH DE number 7385971 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• Area-Time Efficient Architecture of FFT-Based Montgomery Multiplication
• CSIDH: an efficient post-quantum commutative group action
• Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
• Elliptic Curve Cryptosystems
• Encyclopedia of cryptography and security.
• Modular Multiplication Without Trial Division
• New Hardware Architectures for Montgomery Modular Multiplication Algorithm
• SQISign: compact post-quantum signatures from quaternions and isogenies
• Selected Areas in Cryptography
• Selected Areas in Cryptography

This page was built for publication: Modular multiplication in the AMNS representation: hardware implementation

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