Sciweavers

1562 search results - page 48 / 313
» Mathematics, Cryptology, Security
Sort
View
FCS
2006
13 years 9 months ago
Polynomially Uncomputable Number-Theoretic Problems in Cryptography and Network Security
By far the most important automated tool for network and communications security is encryption, but encryption itself needs security. As we know, many cryptosystems and cryptograp...
Song Y. Yan, Glyn James, Gongyi Wu
ASIACRYPT
2000
Springer
14 years 12 days ago
From Fixed-Length to Arbitrary-Length RSA Padding Schemes
A common practice for signing with RSA is to first apply a hash function or a redundancy function to the message, add some padding and exponentiate the resulting padded message us...
Jean-Sébastien Coron, François Koeun...
FSE
1997
Springer
119views Cryptology» more  FSE 1997»
14 years 6 days ago
Cryptanalysis of Ladder-DES
Feistel ciphers are very common and very important in the design and analysis of blockciphers, especially due to four reasons: (1) Many (DES-like) ciphers are based on Feistel’s ...
Eli Biham
CTRSA
2006
Springer
118views Cryptology» more  CTRSA 2006»
13 years 11 months ago
Stand-Alone and Setup-Free Verifiably Committed Signatures
Abstract. In this paper, we first demonstrate a gap between the security of verifiably committed signatures in the two-party setting and the security of verifiably committed signat...
Huafei Zhu, Feng Bao
CRYPTO
2008
Springer
70views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
We propose a family of compression functions built from fixed-key blockciphers and investigate their collision and preimage security in the ideal-cipher model. The constructions ha...
Phillip Rogaway, John P. Steinberger