Highly parallel modular multiplier for elliptic curve cryptography in residue number system
From MaRDI portal
Publication:2399132
DOI10.1007/S00034-016-0336-1zbMath1386.94064OpenAlexW2405898121MaRDI QIDQ2399132
Publication date: 21 August 2017
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00034-016-0336-1
RSAelliptic curve cryptographyresidue number systemmodular multipliercryptosystemhigh speedMontgomery multiplier
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Base extension using a convolution sum in residue number systems
- Modular multiplication using the core function in the residue number system
- FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction
- Modular Multiplication Without Trial Division
- A High Speed Coprocessor for Elliptic Curve Scalar Multiplications over $\mathbb{F}_p$
- Fast base extension using a redundant modulus in RNS
- A method for obtaining digital signatures and public-key cryptosystems
- Residue Number Scaling and Other Operations Using ROM Arrays
- A Residue-to-Binary Converter for a New Five-Moduli Set
- Radix-8 Booth Encoded Modulo $2 ^{n} -1$ Multipliers With Adaptive Delay for High Dynamic Range Residue Number System
- A Parallel and Uniform $k$-Partition Method for Montgomery Multiplication
- Novel RNS Parameter Selection for Fast Modular Multiplication
- An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS
- Extended Double-Base Number System with Applications to Elliptic Curve Cryptography
This page was built for publication: Highly parallel modular multiplier for elliptic curve cryptography in residue number system