Surf Wiki
Save to docs
technology/cryptography

From Surf Wiki (app.surf) — the open knowledge base

Cipher security summary

Attacks against common ciphers

Attacks against common ciphers

This article summarizes publicly known attacks against block ciphers and stream ciphers. Note that there are perhaps attacks that are not publicly known, and not all entries may be up to date.

Table color key

Best attack

This column lists the complexity of the attack:

  • If the attack doesn't break the full cipher, "rounds" refers to how many rounds were broken
  • "time" — time complexity, number of cipher evaluations for the attacker
  • "data" — required known plaintext-ciphertext pairs (if applicable)
  • "memory" — how many blocks worth of data needs to be stored (if applicable)
  • "related keys" — for related-key attacks, how many related key queries are needed

Common ciphers

Key or plaintext recovery attacks

Attacks that lead to disclosure of the key or plaintext.

CipherSecurity claimBest attackPublish dateComment
AES12821282126.1 time, 288 data, 28 memory2011-08-17Independent biclique attack.
AES19221922189.7 time, 280 data, 28 memory
AES25622562254.4 time, 240 data, 28 memory
BlowfishUp to 24484 of 16 rounds; 64-bit block is vulnerable to SWEET32 attack.2016Differential cryptanalysis. Author of Blowfish (Bruce Schneier) recommends using Twofish instead. SWEET32 attack demonstrated birthday attacks to recover plaintext with its 64-bit block size, vulnerable to protocols such as TLS, SSH, IPsec, and OpenVPN, without attacking the cipher itself.{{cite web
Twofish2128 – 22566 of 16 rounds (2256 time)1999-10-05Impossible differential attack.
Serpent-128212810 of 32 rounds (289 time, 2118 data)2002-02-04Linear cryptanalysis.
Serpent-192219211 of 32 rounds (2187 time, 2118 data)
Serpent-2562256
DES256239 – 243 time, 243 known plaintexts2001Linear cryptanalysis. In addition, broken by brute force in 256 time, no later than 1998-07-17, see EFF DES cracker. Cracking hardware is available for purchase since 2006.
Triple DES21682113 time, 232 data, 288 memory; 64-bit block is vulnerable to SWEET32 attack.2016Extension of the meet-in-the-middle attack. Time complexity is 2113 steps, but along with proposed techniques, it is estimated to be equivalent to 290 single DES encryption steps. The paper also proposes other time–memory tradeoffs. SWEET32 attack demonstrated birthday attacks to recover plaintext with its 64-bit block size, vulnerable to protocols such as TLS, SSH, IPsec, and OpenVPN.
KASUMI2128232 time, 226 data, 230 memory, 4 related keys2010-01-10author1=Orr Dunkelmanauthor2=Nathan Kellerauthor3=Adi Shamirdate=2010-01-10title=A Practical-Time Attack on the A5/3 Cryptosystem Used in Third Generation GSM Telephonyjournal=Cryptology ePrint Archiveurl=https://eprint.iacr.org/2010/013 }}
RC4Up to 22048220 time, 216.4 related keys (95% success probability)2007Commonly known as PTW attack, it can break WEP encryption in Wi-Fi on an ordinary computer in negligible time. This is an improvement of the original Fluhrer, Mantin and Shamir attack published in 2001.

Distinguishing attacks

Main article: Distinguishing attack

Attacks that allow distinguishing ciphertext from random data.

CipherSecurity claimBest attackPublish dateComment
RC4up to 22048?? time, 230.6 bytes data (90% probability)2000Paper.

Less-common ciphers

Key recovery attacks

Attacks that lead to disclosure of the key.

CipherSecurity claimBest attackPublish dateComment
CAST (not CAST-128)264248 time, 217 chosen plaintexts1997-11-11Related-key attack.{{cite conference
CAST-12821286 of 16 rounds (288.51 time, 253.96 data)2009-08-23Known-plaintext linear cryptanalysis.
CAST-256225624 of 48 rounds (2156.2 time, 2124.1 data)
IDEA21282126.1 time2012-04-15url=https://www.di.ens.fr/~leurent/files/IDEA_EC12.pdftitle=Narrow-Bicliques: Cryptanalysis of Full IDEAauthor1=Dmitry Khovratovichauthor2=Gaetan Leurentauthor3=Christian Rechbergeraccess-date=2015-08-26archive-url=https://web.archive.org/web/20131203001223/http://www.di.ens.fr/~leurent/files/IDEA_EC12.pdfarchive-date=2013-12-03 }}
MISTY12128269.5 time, 264 chosen plaintexts2015-07-30Chosen-ciphertext, integral cryptanalysis, an improvement over a previous chosen-plaintext attack.
RC2264 – 2128Unknown time, 234 chosen plaintexts1997-11-11Related-key attack.
RC52128
SEED2128
Skipjack280280ECRYPT II recommendations note that, as of 2012, 80 bit ciphers provide only "Very short-term protection against agencies". NIST recommends not to use Skipjack after 2010.
TEA2128232 time, 223 chosen plaintexts1997-11-11Related-key attack.
XTEA2128
XXTEA2128259 chosen plaintexts2010-05-04Chosen-plaintext, differential cryptanalysis.

Distinguishing attacks

Main article: Distinguishing attack

Attacks that allow distinguishing ciphertext from random data.

CipherSecurity claimBest attackPublish dateComment
CAST-256225628 of 48 rounds (2246.9 time, 268 memory, 298.8 data)2012-12-04Multidimensional zero-correlation cryptanalysis.

References

References

  1. (2011-08-17). "Biclique Cryptanalysis of the Full AES". Cryptology ePrint Archive.
  2. Vincent Rijmen. (1997). "Cryptanalysis and Design of Iterated Block Ciphers". Ph.D. Thesis.
  3. Dahna McConnachie. (2007-12-27). "Bruce Almighty: Schneier preaches security to Linux faithful". Computerworld.
  4. Niels Ferguson. (1999-10-05). "Impossible Differentials in Twofish".
  5. (2002-02-04). "Linear Cryptanalysis of Reduced Round Serpent".
  6. Junod, Pascal. (2001). "On the Complexity of Matsui's Attack".
  7. "DES Cracker Project". EFF.
  8. "COPACOBANA – Special-Purpose Hardware for Code-Breaking".
  9. Stefan Lucks. (1998-03-23). "Attacking Triple Encryption". Springer.
  10. (2010-01-10). "A Practical-Time Attack on the A5/3 Cryptosystem Used in Third Generation GSM Telephony". Cryptology ePrint Archive.
  11. Erik Tews. (2007). "Breaking 104 Bit WEP in Less Than 60 Seconds".
  12. (2001-12-20). "Weaknesses in the Key Scheduling Algorithm of RC4".
  13. Scott R. Fluhrer. "Statistical Analysis of the Alleged RC4 Keystream Generator".
  14. (2009-08-23). "Selected Areas in Cryptography".
  15. "Narrow-Bicliques: Cryptanalysis of Full IDEA".
  16. Achiya Bar-On. (2015-07-30). "A 270 Attack on the Full MISTY1". Cryptology ePrint Archive.
  17. Yosuke Todo. (2015-07-06). "Integral Cryptanalysis on Full MISTY1".
  18. (30 September 2012). "ECRYPT II Yearly Report on Algorithms and Keysizes (2011-2012)".
  19. [http://csrc.nist.gov/publications/nistpubs/800-131A/sp800-131A.pdf Transitions: Recommendation for Transitioning the Use of Cryptographic Algorithms and Key Lengths], NIST
  20. Elias Yarrkov. (2010-05-04). "Cryptanalysis of XXTEA". Cryptology ePrint Archive.
  21. Andrey Bogdanov. (2012-12-04). "Integral and multidimensional linear distinguishers with correlation zero". Springer.
Info: Wikipedia Source

This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.

block-ciphers cryptography-lists-and-comparisons
Want to explore this topic further?

Ask Mako anything about Cipher security summary — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report