
doi: 10.1515/jmc.2008.006
Abstract Multi-prime RSA is a variant of RSA in which the modulus is the product of more than two distinct primes. In this work we collect the strongest known algebraic attacks on multi-prime RSA, including factoring, small private exponent, small CRT exponent and partial key exposure attacks.
Algebraic coding theory; cryptography (number-theoretic aspects), cryptanalysis, partial key exposure, QA1-939, Cryptography, multi-prime rsa, lattice attacks, multi-prime RSA, Mathematics, small private exponent
Algebraic coding theory; cryptography (number-theoretic aspects), cryptanalysis, partial key exposure, QA1-939, Cryptography, multi-prime rsa, lattice attacks, multi-prime RSA, Mathematics, small private exponent
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 20 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
