A Generalized Attack on the Multi-prime Power RSA
Publication Name
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Abstract
The Multi-Prime Power RSA is an efficient variant of the RSA cryptosystem with a modulus of the form N= prqs and r> s≥ 2. It can be used with a public exponent e and a private exponent d satisfying e≡1d(modpr-1qs-1(p-1)(q-1)). In 2017, Lu, Peng and Sarkar showed that one can factor the modulus N= prqs if d
Open Access Status
This publication is not available as open access
Volume
13503 LNCS
First Page
537
Last Page
549