Bulygin, Stanislav (2009)
Computer algebra in coding theory and cryptanalysis: Polynomial system solving for decoding linear codes and algebraic cryptanalysis.
Buch, Bibliographie
Kurzbeschreibung (Abstract)
his book that represents the author's Ph.D. thesis is devoted to applying symbolic methods to the problems of decoding linear codes and of algebraic cryptanalysis. The initial problems are reformulated in terms of systems of polynomial equations over a finite field, which solution(s) should yield a way to solve the initial problems. Solutions of such systems are obtained using Gröbner bases. The first part is devoted to an application of system solving to decoding linear codes. The original method for arbitrary linear codes, which in some sense generalizes the Newton identities method widely known for cyclic codes, is proposed. Since for the method to work the „field equations“ are not needed, it is possible to handle quite large codes. The second part is about the algebraic cryptanalysis of the AES. The systems usually considered in this area have many auxiliary variables that are not needed for the key recovery. Therefore, here the approach is provided where these variables are eliminated and a resulting system in key-variables only is then solved. This is shown to be effective for small scale variants of the AES especially when using several plain-/ciphertext pairs.
| Typ des Eintrags: | Buch |
|---|---|
| Erschienen: | 2009 |
| Autor(en): | Bulygin, Stanislav |
| Art des Eintrags: | Bibliographie |
| Titel: | Computer algebra in coding theory and cryptanalysis: Polynomial system solving for decoding linear codes and algebraic cryptanalysis |
| Sprache: | Deutsch |
| Publikationsjahr: | September 2009 |
| Ort: | Saarbrücken |
| Verlag: | Südwestdeutscher Verlag für Hochschulschriften |
| Kurzbeschreibung (Abstract): | his book that represents the author's Ph.D. thesis is devoted to applying symbolic methods to the problems of decoding linear codes and of algebraic cryptanalysis. The initial problems are reformulated in terms of systems of polynomial equations over a finite field, which solution(s) should yield a way to solve the initial problems. Solutions of such systems are obtained using Gröbner bases. The first part is devoted to an application of system solving to decoding linear codes. The original method for arbitrary linear codes, which in some sense generalizes the Newton identities method widely known for cyclic codes, is proposed. Since for the method to work the „field equations“ are not needed, it is possible to handle quite large codes. The second part is about the algebraic cryptanalysis of the AES. The systems usually considered in this area have many auxiliary variables that are not needed for the key recovery. Therefore, here the approach is provided where these variables are eliminated and a resulting system in key-variables only is then solved. This is shown to be effective for small scale variants of the AES especially when using several plain-/ciphertext pairs. |
| Freie Schlagworte: | Secure Data |
| ID-Nummer: | TUD-CS-2009-0227 |
| Fachbereich(e)/-gebiet(e): | LOEWE LOEWE > LOEWE-Zentren LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt |
| Hinterlegungsdatum: | 30 Dez 2016 20:23 |
| Letzte Änderung: | 20 Mai 2021 08:55 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum