conference paper
Computing Inverses over a Shared Secret Modulus
Dario Catalanoa, Rosario Gennarob, Shai Halevib
- aDipartimento di Matematica e Informatica, Università di Catania, Viale A. Doria 6, 95125, Catania
- bIBM T.J.Watson Research Center, PO Box 704, Yorktown Heights, New York, 10598, USA
Lecture notes in computer scienceSpringer Science+Business Media2000-01-01 59 citations35 references
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRNew and efficient protocols are presented to solve the problem of how can the players efficiently compute a sharing of e-1 mod φ, when φ is the Euler function of a known RSA modulus N, φ = φ(N). (Semantic Scholar)