257 search results - page 26 / 52 » On the Security of RSA Screening |
WCC
2005
Springer
14 years 1 months ago
2005
Springer
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
CRYPTO
2004
Springer
14 years 1 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...
IJIT
2004
13 years 9 months ago
2004
We present a new model for undeniable signatures: fair-anonymous undeniable signatures. This protocol can not only preserve the privacy of the signer (i.e. anonymity) but also trac...
IMC
2007
ACM
13 years 9 months ago
2007
ACM
The Secure Socket Layer (SSL) and its variant, Transport Layer Security (TLS), are used toward ensuring server security. In this paper, we characterize the cryptographic strength ...
EUROCRYPT
2001
Springer
14 years 9 days ago
2001
Springer
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...