Greedy Distinguishers and Nonrandomness Detectors

DOI10.1007/978-3-642-17401-8_16zbMath1294.94078OpenAlexW1865395495WikidataQ62041918 ScholiaQ62041918MaRDI QIDQ3058726

Paul Stankovski

Publication date: 7 December 2010

Published in: Progress in Cryptology - INDOCRYPT 2010 (Search for Journal in Brave)

Full work available at URL: https://lup.lub.lu.se/record/1747288

zbMATH Keywords

DESSMS4algebraic cryptanalysisSalsaAESdistinguisherCamelliaCLEFIASEEDGrainTriviumPRESENTRC5TEAXTEAHIGHTRabbitMICKEYEdon80HCmaximum degree monomialnonrandomness detectorRC6Sosemanuk

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (13)

Conditional differential cryptanalysis of 105 round Grain v1 ⋮ Conditional Differential Cryptanalysis of Trivium and KATAN ⋮ High order differential attacks on stream ciphers ⋮ Quark: a lightweight hash ⋮ Correlation cube attacks: from weak-key distinguisher to key recovery ⋮ Some cryptanalytic results on TRIAD ⋮ Near Collision Attack on the Grain v1 Stream Cipher ⋮ A practical key-recovery attack on 805-round Trivium ⋮ Espresso: a stream cipher for 5G wireless communication systems ⋮ Breaking Grain-128 with Dynamic Cube Attacks ⋮ Observing biases in the state: case studies with Trivium and Trivia-SC ⋮ Cube Cryptanalysis of Round-Reduced ACORN ⋮ New cube distinguishers on NFSR-based stream ciphers

Uses Software

• Unnamed Item
• PRESENT
• Rabbit
• HIGHT
• SOSEMANUK
• Camellia
• MICKEY
• eSTREAM
• Grain
• TEA
• XTEA
• Edon80

This page was built for publication: Greedy Distinguishers and Nonrandomness Detectors