A Fast Large-Integer Extended GCD Algorithm and Hardware Design for Verifiable Delay Functions and Modular Inversion

A Fast Large-Integer Extended GCD Algorithm and Hardware Design for Verifiable Delay Functions and Modular Inversion

Show other versions (1)

The extended GCD (XGCD) calculation, which computes Bézout coefficients ba, bb such that ba ∗ a0 + bb ∗ b0 = GCD(a0, b0), is a critical operation in many cryptographic applications. In particular, large-integer XGCD is computationally dominant for two applications of increasing interest: verifiable...

Full description

Bibliographic Details
Main Authors: Kavya Sreedhar, Mark Horowitz, Christopher Torng
Format: Article
Language:English
Published: Ruhr-Universität Bochum 2022-08-01
Series:Transactions on Cryptographic Hardware and Embedded Systems
Subjects:
Extended GCD
ASIC
Verifiable delay function
Class groups
Squaring binary quadratic forms
Constant-time
Online Access:https://tches.iacr.org/index.php/TCHES/article/view/9817

Internet

https://tches.iacr.org/index.php/TCHES/article/view/9817

Similar Items