Newsletter Downloads
Coin flipping by telephone a protocol for solving impossible problems
Alice and Bob want to flip a coin by telephone. (They have just divorced, live in different cities, want to decide who gets the car.) Bob would not like to tell Alice HEADS and hear Alice (at the other end of the line) say "Here goes . . . I'm flipping ...
On the necessity of cryptanalytic exhaustive search
It is shown that the amount of computation required for a general cryptanalytic method is equivalent to an exhaustive search over the key space. In particular, any general time-memory tradeoff must do an exhaustive search as a part of the pre- or post-...
On the feasibility of computing discrete logarithms using Adleman's subexponential algorithm
Some public key distribution systems, based on the difficulties in computing logarithms modulo a large prime, have been alleged to be insecure because of a statement that any logarithm modulo a 200 bit prime can be computed within a reasonable time by ...
A variant of a public key cryptosystem based on Goppa Codes
This paper suggests a way in which an interesting Public Key Cryptosystem based on Goppa Codes introduced by R. J. McEliece can be modified and used in a classical way to yield several advantages. The primary benefit is that the rate of the code (or ...
