Post-Quantum Cryptography on FPGA Based on Isogenies on Elliptic Curves
Document Type
Article
Publication Date
1-2017
Keywords
post-quantum cryptography, Elliptic curve cryptography (ECC), field programmable gate array (FPGA), isogeny-based cryptography
Digital Object Identifier (DOI)
https://doi.org/10.1109/TCSI.2016.2611561
Abstract
To the best of our knowledge, we present the first hardware implementation of isogeny-based cryptography available in the literature. Particularly, we present the first implementation of the supersingular isogeny Diffie-Hellman (SIDH) key exchange, which features quantum-resistance. We optimize this design for speed by creating a high throughput multiplier unit, taking advantage of parallelization of arithmetic in Fp2, and minimizing pipeline stalls with optimal scheduling. Consequently, our results are also faster than software libraries running affine SIDH even on Intel Haswell processors. For our implementation at 85-bit quantum security and 128-bit classical security, we generate ephemeral public keys in 1.655 million cycles for Alice and 1.490 million cycles for Bob. We generate the shared secret in an additional 1.510 million cycles for Alice and 1.312 million cycles for Bob. On a Virtex-7, these results are approximately 1.5 times faster than known software implementations running the same 512-bit SIDH. Our results and observations show that the isogeny-based schemes can be implemented with high efficiency on reconfigurable hardware.
Was this content written or created while at USF?
No
Citation / Publisher Attribution
IEEE Transactions on Circuits and Systems I: Regular Papers, v. 64, issue 1, p. 86-99
Scholar Commons Citation
Koziel, Brian; Azarderakhsh, Reza; Mozaffari Kermani, Mehran; and Jao, David, "Post-Quantum Cryptography on FPGA Based on Isogenies on Elliptic Curves" (2017). Computer Science and Engineering Faculty Publications. 27.
https://digitalcommons.usf.edu/esb_facpub/27
