Algorithmica
A World Wide Number Field Sieve Factoring Record: On to 512 Bits
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Factorization of the Numbers of the Form m3+c2m2+c1m+c0
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Finding a small root of a bivariate integer equation; factoring with high bits known
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
An Advantage of Low-Exponent RSA with Modulus Primes Sharing Least Significant Bits
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
On the Security of RSA Padding
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Towards Signature-Only Signature Schemes
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Unbelievable Security. Matching AES Security Using Public Key Systems
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Proceedings of the 8th IMA International Conference on Cryptography and Coding
An X.509-Compatible Syntax for Compact Certificates
Proceedings of the International Exhibition and Congress on Secure Networking - CQRE (Secure) '99
New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Practical Broadcast Authentication Using Short-Lived Signatures in WSNs
Information Security Applications
Kleptography from standard assumptions and applications
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Speeding up bipartite modular multiplication
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Publishing upper half of RSA decryption exponent
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
On the possibility of constructing meaningful hash collisions for public keys
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Malicious cryptography: kleptographic aspects
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Efficient CRT-RSA decryption for small encryption exponents
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
A space efficient backdoor in RSA and its applications
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Public key compression and modulus switching for fully homomorphic encryption over the integers
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Side channel attack to actual cryptanalysis: breaking CRT-RSA with low weight decryption exponents
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
Another look at affine-padding RSA signatures
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
Upper bound of the length of information embedd in RSA public key efficiently
Proceedings of the first ACM workshop on Asia public-key cryptography
High-Performance scalar multiplication using 8-dimensional GLV/GLS decomposition
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
Hi-index | 0.00 |
This paper reviews and generalizes a method to generate RSA moduli with a predetermined portion. The potential advantages of the resulting methods are discussed: both the storage and the computational requirements of the RSA cryptosystem can be considerably reduced. The constructions are as efficient as generation of regular RSA moduli, and the resulting moduli do not seem to offer less security than regular RSA moduli.