Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am researching how quantum computers affect current encryption methods (RSA and more).

However, I remember learning in a course that there used to be a particular encryption method which was popular but suddenly had a very bad vulnerability in the past (like quantum computers and Shor's algorithm would be for RSA) and everybody had to move on (is that right?).

I cannot find anything about this in the past, does anybody have any idea which cryptosystem I am talking about?

share|improve this question
    
Might be braid group cryptosystems? – pg1989 4 hours ago
    
pg1989. I hope to change that using some generalizations of braid groups (unless these cryptosystems based on these new groups will be shown to be insecure). – Joseph Van Name 2 hours ago
up vote 6 down vote accepted

You could be thinking about the Merkle-Hellman knapsack cryptosystem. It was invented in 1978 and everything seemed well and good until it was completely broken six years later in 1984 by Shamir - it was a complete and total break, i.e. the cryptosystem became unusable overnight.

That said I don't know if the knapsack cryptosystem was ever "popular" in the modern sense (it was 1978 after all) but it was certainly an early public key cryptosystem that met an unfortunate end.


On the other hand, for an example of a progressively worn-down algorithm (as opposed to one being broken immediately) there is of course MD5's collision resistance.

share|improve this answer
    
I'm not sure if that was the one, but this is what I needed! Thanks! Just want to point out that some sources cite that the cryptosystem broke in 1982 for future readers (at Crypto '82). However, some other sources refer to 1984. I think 1984 is the paper's publishing date and 1982 is the date of breaking the system. – Kevin Van Ryckegem 5 hours ago

This is a shot in the dark, but could you be thinking of the Needham-Schroeder protocol? It was published in 1978 [1], and an attack was published as much as 18 years later, in 1996 [2]. It is not an encryption method, though, but a protocol. In fact, the original paper does not even specify an encryption method to be used, but uses encryption symbolically. Accordingly, the discovered flaw has nothing to do with encryption; rather, it is a conceptual flaw in the protocol's design. However, it is often used in cryptography/security courses as a historical example of a protocol broken late after its invention, so I thought you might have been thinking of this one.

Another popular example that comes to mind is WEP, a link-layer security protocol which was part of the original IEEE 802.11 specification from 1997 and the predecessor of WPA/WPA2. This one was broken due to cryptographic breaches resulting from various weaknesses in its design and misapplications of cryptographic primitives [3,4].

  • [1] Roger M. Needham, Michael D. Schroeder. Using Encryption for Authentication in Large Networks of Computers. Commun. ACM 21(12): 993-999 (1978)
  • [2] Gavin Lowe. Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR. TACAS 1996: 147-166
  • [3] Nikita Borisov, Ian Goldberg, David Wagner. Intercepting mobile communications: the insecurity of 802.11. MOBICOM 2001: 180-189
  • [4] Scott R. Fluhrer, Itsik Mantin, Adi Shamir. Weaknesses in the Key Scheduling Algorithm of RC4. Selected Areas in Cryptography 2001: 1-24
share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.