CRYPTO
1992
Springer
13 years 8 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...
CRYPTO
1992
Springer
13 years 8 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
1992
Springer
13 years 8 months ago
1992
Springer
Using a number field sieve, discrete logarithms modulo primes of special forms can be found faster than standard primes. This has raised concerns about trapdoors in discrete log cr...
CRYPTO
1992
Springer
13 years 8 months ago
1992
Springer
CRYPTO
1992
Springer
13 years 8 months ago
1992
Springer
CRYPTO
1992
Springer
13 years 8 months ago
1992
Springer
CRYPTO
1992
Springer
13 years 8 months ago
1992
Springer
CRYPTO
1992
Springer
13 years 8 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 8 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...