Name
Abstract | ||
|---|---|---|
In this paper we introduce Janus, a software framework written in Java - which is built to provide assistance in finding independent-biclique attacks for a user-chosen set of parameters, e.g., the number of rounds and dimension of the biclique. Given a certain cipher, Janus not only finds an optimal bipartite graph (biclique), but also provides an all-round carefree package of finding an optimal matching-with-pre-computation step, rendering the found biclique, and determining the computational complexity of the attack. We have used the Janus framework to verify existing results on ARIA and the AES. Additionally, by using this framework, we could find the first full-round biclique attacks on all versions of the AES-like cipher BKSQ. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-662-43933-3_29 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Automated cryptanalysis,Biclique,BKSQ | Cipher,Complete bipartite graph,Bipartite graph,Cryptanalysis,Theoretical computer science,Rendering (computer graphics),Java,Software framework,Mathematics,Computational complexity theory | Conference |
Volume | ISSN | Citations |
8424 | 0302-9743 | 3 |
PageRank | References | Authors |
0.41 | 13 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Farzaneh Abed | 1 | 88 | 6.67 |
| Christian Forler | 2 | 144 | 12.56 |
| Eik List | 3 | 111 | 13.70 |
| Stefan Lucks | 4 | 1083 | 108.87 |
| Jakob Wenzel | 5 | 116 | 9.80 |