Modular Inverse for Integers using Fast Constant Time GCD Algorithm and its Applications

Sanjay Deshpande, Santos Merino del Pozo,Victor Mateu,Marc Manzano,Najwa Aaraj,Jakub Szefer

2021 31st International Conference on Field-Programmable Logic and Applications (FPL)（2021）

引用 6|浏览16

暂无评分

摘要

Modular inversion, the multiplicative inverse of an integer in the ring of integers modulo a prime number, is widely used in public-key cryptography. However, it is one of the most computationally intensive operations, thus, it remains the main performance bottleneck for many cryptographic algorithms.This paper presents to the best of the author’s knowledge, the first FPGA-based hardware design fo...

查看译文

关键词

modular inverse, constant time, fast gcd algorithm, hardware design, elgamal decryption, modular inversion, modular inverse calculation, fermat method, variable shifter, hardware implementation, sequential design, full width design, fast gcd inverse, control logic, modular multiplication, elgamal cryptosystem, modular exponentiation, modular inverse operation, elgamal decryption algorithm, elgamal decryption unit, modular inverse unit, public key cryptography, public key, cryptographic application, key generation, fast constant time gcd, constant time gcd algorithm, time area, mersenne prime

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要