Modular multiplication in the AMNS representation: hardware implementation
From MaRDI portal
Cites work
- A cryptographic library for the Motorola DSP56000
- A method for obtaining digital signatures and public-key cryptosystems
- A scalable architecture for Montgomery multiplication
- 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.
- High-radix design of a scalable modular multiplier
- scientific article; zbMATH DE number 7385971 (Why is no real title available?)
- Modular Multiplication Without Trial Division
- More generalized Mersenne numbers
- New Hardware Architectures for Montgomery Modular Multiplication Algorithm
- Selected Areas in Cryptography
- SQISign: compact post-quantum signatures from quaternions and isogenies
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)