Refined cryptanalysis of the GPRS ciphers GEA-1 and GEA-2

DOI10.1007/978-3-031-07082-2_3zbMath1496.94026OpenAlexW4285303094MaRDI QIDQ2170080

Itai Dinur, Dor Amzaleg

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-07082-2_3

zbMATH Keywords

analysis of GEA-1analysis of GEA-2

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Meet-in-the-middle preimage attacks on sponge-based hashing ⋮ Constructing and deconstructing intentional weaknesses in symmetric ciphers

Uses Software

• KTANTAN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cryptanalysis of the GPRS encryption algorithms GEA-1 and GEA-2
• Low-memory attacks against two-round Even-Mansour using the 3-XOR problem
• Refinements of the k-tree Algorithm for the Generalized Birthday Problem
• New Preimage Attacks against Reduced SHA-1
• Space-Efficient Randomized Algorithms for K-SUM
• A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN
• Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1
• New Generic Algorithms for Hard Knapsacks
• Fast Exhaustive Search for Polynomial Systems in ${\mathbb{F}_2}$
• A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
• Algorithmic Cryptanalysis

This page was built for publication: Refined cryptanalysis of the GPRS ciphers GEA-1 and GEA-2