TU Darmstadt / ULB / TUbiblio

Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC

Walter, Michael and Bulygin, Stanislav and Buchmann, Johannes
Kutylowski, Miroslaw and Yung, Moti (eds.) (2012):
Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC.
In: The 8th China International Conference on Information Security and Cryptology (Inscrypt 2012), Springer, Beijing, China, In: Lecture Notes in Computer Science, 7763, ISBN 978-3-642-38518-6,
[Conference or Workshop Item]

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 and Yung, Moti
Creators: Walter, Michael and Bulygin, Stanislav and Buchmann, Johannes
Title: Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC
Language: ["languages_typename_1" not defined]
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.

Title of Book: The 8th China International Conference on Information Security and Cryptology (Inscrypt 2012)
Series Name: Lecture Notes in Computer Science
Volume: 7763
Publisher: Springer
ISBN: 978-3-642-38518-6
Uncontrolled Keywords: Secure Data;Algebraic Cryptanalysis, Lightweight Cryptography, Guessing Strategies, Mixed
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
Event Location: Beijing, China
Date Deposited: 30 Dec 2016 20:23
Identification Number: TUD-CS-2012-0219
Export:
Suche nach Titel in: TUfind oder in Google

Optionen (nur für Redakteure)

View Item View Item