Walter, Michael ; Bulygin, Stanislav ; Buchmann, Johannes
Hrsg.: Kutylowski, Miroslaw ; Yung, Moti (2012)
Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC.
Beijing, China
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (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.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2012 |
| Herausgeber: | Kutylowski, Miroslaw ; Yung, Moti |
| Autor(en): | Walter, Michael ; Bulygin, Stanislav ; Buchmann, Johannes |
| Art des Eintrags: | Bibliographie |
| Titel: | Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC |
| Sprache: | Englisch |
| Publikationsjahr: | November 2012 |
| Verlag: | Springer |
| Buchtitel: | The 8th China International Conference on Information Security and Cryptology (Inscrypt 2012) |
| Reihe: | Lecture Notes in Computer Science |
| Band einer Reihe: | 7763 |
| Veranstaltungsort: | Beijing, China |
| Kurzbeschreibung (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. |
| Freie Schlagworte: | Secure Data;Algebraic Cryptanalysis, Lightweight Cryptography, Guessing Strategies, Mixed |
| ID-Nummer: | TUD-CS-2012-0219 |
| Fachbereich(e)/-gebiet(e): | LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt 20 Fachbereich Informatik > Theoretische Informatik - Kryptographie und Computeralgebra 20 Fachbereich Informatik > Theoretische Informatik - Kryptographie und Computeralgebra > Kryptoanalyse und Seitenkanalangriffe (CSCA) LOEWE > LOEWE-Zentren 20 Fachbereich Informatik LOEWE |
| Hinterlegungsdatum: | 30 Dez 2016 20:23 |
| Letzte Änderung: | 17 Mai 2018 13:02 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum