FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction
From MaRDI portal
Publication:3172983
DOI10.1007/978-3-642-23951-9_28zbMath1285.94048OpenAlexW2097953324MaRDI QIDQ3172983
Sylvain Duquesne, Nicolas Guillermin, Junfeng Fan, Ray C. C. Cheung, Ingrid Verbauwhede, Gavin Xiaoxu Yao
Publication date: 7 October 2011
Published in: Cryptographic Hardware and Embedded Systems – CHES 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-23951-9_28
Related Items (9)
Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves ⋮ Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$ ⋮ Highly parallel modular multiplier for elliptic curve cryptography in residue number system ⋮ A survey of fault attacks in pairing based cryptography ⋮ Implementing optimized pairings with elliptic nets ⋮ Finite field arithmetic in large characteristic for classical and post-quantum cryptography ⋮ Choosing and generating parameters for pairing implementation on BN curves ⋮ Updating key size estimations for pairings ⋮ Parallelizing the Weil and Tate Pairings
This page was built for publication: FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction
