FPGA implementation of pairings using residue number system and lazy reduction
From MaRDI portal
Publication:3172983
Recommendations
Cited in
(13)- An FPGA systolic array using pseudo-random bit generators for computing Goldbach partitions
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- Updating key size estimations for pairings
- Parallelizing the Weil and Tate pairings
- Highly parallel modular multiplier for elliptic curve cryptography in residue number system
- RNS arithmetic in \(\mathbb F_{p^{k}}\) and application to fast pairing computation
- Faster pairing coprocessor architecture
- Implementing optimized pairings with elliptic nets
- Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$
- Choosing and generating parameters for pairing implementation on BN curves
- Finite field arithmetic in large characteristic for classical and post-quantum cryptography
- Direct Implementation of Discrete and Residue-Based Functions Via Optimal Encoding: A Programmable Array Logic Approach
- A survey of fault attacks in pairing based cryptography
This page was built for publication: FPGA implementation of pairings using residue number system and lazy reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172983)