RSA and ECC universal, constant time modular inversion

2021 ◽  
Author(s):  
Szymon Sarna ◽  
Robert Czerwinski
2014 ◽  
Vol 4 (4) ◽  
pp. 275-281 ◽  
Author(s):  
Joppe W. Bos

Author(s):  
Daniel J. Bernstein ◽  
Bo-Yin Yang

This paper introduces streamlined constant-time variants of Euclid’s algorithm, both for polynomial inputs and for integer inputs. As concrete applications, this paper saves time in (1) modular inversion for Curve25519, which was previously believed to be handled much more efficiently by Fermat’s method, and (2) key generation for the ntruhrss701 and sntrup4591761 lattice-based cryptosystems.


2002 ◽  
Vol 38 (9) ◽  
pp. 396 ◽  
Author(s):  
J.F. Duque-Carrillo ◽  
J.M. Carrillo ◽  
J.L. Ausı́N ◽  
E. Sánchez-Sinencio

2011 ◽  
Vol 18 (11) ◽  
pp. 651-654 ◽  
Author(s):  
K. N. Chaudhury
Keyword(s):  

IEEE Micro ◽  
1995 ◽  
Vol 15 (3) ◽  
pp. 60-71 ◽  
Author(s):  
A. Louri ◽  
J.A. Hatch ◽  
Jongwhoa Na

Author(s):  
Sebastian Banescu ◽  
Martin Derka ◽  
Jan Gorzny ◽  
Sung-Shine Lee ◽  
Alex Murashkin
Keyword(s):  

Author(s):  
Sunjay Cauligi ◽  
Craig Disselkoen ◽  
Klaus v. Gleissenthall ◽  
Dean Tullsen ◽  
Deian Stefan ◽  
...  
Keyword(s):  

1995 ◽  
Vol 27 (1) ◽  
pp. 86-99 ◽  
Author(s):  
V. Bokka ◽  
H. Gurla ◽  
S. Olariu ◽  
J.L. Schwing

Sign in / Sign up

Export Citation Format

Share Document