11 search results - page 2 / 3 » crypto 1992 |
CRYPTO
1992
Springer
13 years 9 months ago
1992
Springer
We prove that the set of DES permutations (encryption and decryption for each DES key) is not closed under functional composition. This implies that, in general, multiple DES-encry...
CRYPTO
1992
Springer
13 years 9 months ago
1992
Springer
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt ...
CRYPTO
2003
Springer
13 years 10 months ago
2003
Springer
In 1992, Dwork and Naor proposed that e-mail messages be accompanied by easy-to-check proofs of computational effort in order to discourage junk e-mail, now known as spam. They pro...
CRYPTO
1992
Springer
13 years 9 months ago
1992
Springer
Blakley, Blakley, Chan and Massey conjectured a lower bound on the entropy of broadcast messages in threshold schemes with disenrollment. In an effort to examine the conjecture, w...
CRYPTO
1992
Springer
13 years 9 months ago
1992
Springer
Abstract Joseph Kilian NEC Research Princeton, NJ 08540 Tom Leighton Mathematics Department Laboratory for Computer Science MIT Cambridge, MA 02139 August 17, 1994 Fair" Publ...