Paper 2024/1253
FELIX (XGCD for FALCON): FPGA-based Scalable and Lightweight Accelerator for Large Integer Extended GCD
Abstract
The Extended Greatest Common Divisor (XGCD) computation is a critical component in various cryptographic applications and algorithms, including both pre- and post-quantum cryptosystems. In addition to computing the greatest common divisor (GCD) of two integers, the XGCD also produces Bezout coefficients
Note: NA
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Published elsewhere. Minor revision. IEEE Trans. VLSI Systems
- DOI
- 10.1109/TVLSI.2024.3417016
- Keywords
- Falconfield-programmable gate arrayhardware acceleratorlarge integer extended GCDcryptographic applications
- Contact author(s)
-
scoulon @ villanova edu
tbao @ villanova edu
jiafeng xie @ villanova edu - History
- 2024-08-09: approved
- 2024-08-08: received
- See all versions
- Short URL
- https://ia.cr/2024/1253
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1253, author = {Sam Coulon and Tianyou Bao and Jiafeng Xie}, title = {{FELIX} ({XGCD} for {FALCON}): {FPGA}-based Scalable and Lightweight Accelerator for Large Integer Extended {GCD}}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1253}, year = {2024}, doi = {10.1109/TVLSI.2024.3417016}, url = {https://eprint.iacr.org/2024/1253} }