TU Darmstadt / ULB / TUbiblio

Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC

Walter, Michael ; Bulygin, Stanislav ; Buchmann, Johannes
eds.: Kutylowski, Miroslaw ; Yung, Moti (2012)
Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC.
Beijing, China
Conference or Workshop Item, Bibliographie

Abstract

In this paper we demonstrate how to use Mixed Integer Linear Programming to optimize guessing strategies for algebraic cryptanalysis with applications to the block cipher EPCBC. Using our optimized guessing strategy we are able to attack 5 rounds of EPCBC-96 and 8 rounds of EPCBC-48 faster than brute force using one and two known plaintexts resp. Finally, we are able to identify a class of weak keys for which the attack is faster than brute force for up to 7 rounds of EPCBC-96. Alongside results on EPCBC we believe that the proposed technique of optimized guessing is a useful tool in a more general context of algebraic cryptanalysis.

Item Type: Conference or Workshop Item
Erschienen: 2012
Editors: Kutylowski, Miroslaw ; Yung, Moti
Creators: Walter, Michael ; Bulygin, Stanislav ; Buchmann, Johannes
Type of entry: Bibliographie
Title: Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC
Language: English
Date: November 2012
Publisher: Springer
Book Title: The 8th China International Conference on Information Security and Cryptology (Inscrypt 2012)
Series: Lecture Notes in Computer Science
Series Volume: 7763
Event Location: Beijing, China
Abstract:

In this paper we demonstrate how to use Mixed Integer Linear Programming to optimize guessing strategies for algebraic cryptanalysis with applications to the block cipher EPCBC. Using our optimized guessing strategy we are able to attack 5 rounds of EPCBC-96 and 8 rounds of EPCBC-48 faster than brute force using one and two known plaintexts resp. Finally, we are able to identify a class of weak keys for which the attack is faster than brute force for up to 7 rounds of EPCBC-96. Alongside results on EPCBC we believe that the proposed technique of optimized guessing is a useful tool in a more general context of algebraic cryptanalysis.

Uncontrolled Keywords: Secure Data;Algebraic Cryptanalysis, Lightweight Cryptography, Guessing Strategies, Mixed
Identification Number: TUD-CS-2012-0219
Divisions: LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
20 Department of Computer Science > Theoretical Computer Science - Cryptography and Computer Algebra
20 Department of Computer Science > Theoretical Computer Science - Cryptography and Computer Algebra > Cryptanalysis and Side Channel Attacks (CSCA)
LOEWE > LOEWE-Zentren
20 Department of Computer Science
LOEWE
Date Deposited: 30 Dec 2016 20:23
Last Modified: 17 May 2018 13:02
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details