A Fast Large-Integer Extended GCD Algorithm and Hardware Design for Verifiable Delay Functions and Modular Inversion
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...
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: | |
Online Access: | https://tches.iacr.org/index.php/TCHES/article/view/9817 |
Similar Items
-
A Fast Large-Integer Extended GCD Algorithm and Hardware Design for Verifiable Delay Functions and Modular Inversion
by: Kavya Sreedhar, et al.
Published: (2022-08-01) -
Low-Latency Design and Implementation of the Squaring in Class Groups for Verifiable Delay Function Using Redundant Representation
by: Danyang Zhu, et al.
Published: (2022-11-01) -
New results on the divisibility of power GCD and power LCM matrices
by: Guangyan Zhu, et al.
Published: (2022-08-01) -
A Review of Techniques for Implementing Elliptic Curve Point Multiplication on Hardware
by: Arielle Verri Lucca, et al.
Published: (2020-12-01) -
Mean Value of <i>r</i>-gcd-sum and <i>r</i>-lcm-Sum Functions
by: Zhengjin Bu, et al.
Published: (2022-10-01)