20 search results - page 4 / 4 » Factorization of a 512-Bit RSA Modulus |
ISW
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Signcryption is a public-key cryptographic primitive introduced by Zheng, which achieves both message confidentiality and nonrepudiatable origin authenticity, at a lower ...
CRYPTO
2004
Springer
13 years 10 months ago
2004
Springer
Ordinarily, RSA and Rabin ciphertexts and signatures are log N bits, where N is a composite modulus; here, we describe how to “compress” Rabin ciphertexts and signatures (among...
CTRSA
2010
Springer
14 years 5 days ago
2010
Springer
At ches 2009, Coron, Joux, Kizhvatov, Naccache and Paillier (cjknp) exhibited a fault attack against rsa signatures with partially known messages. This attack allows factoring the ...
INDOCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure in the standard model. The scheme uses arithmetic modulo n2...
ACISP
2000
Springer
13 years 9 months ago
2000
Springer
We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications. 1 Ove...