References of "Journal of Cryptology"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailA Note on the Bivariate Coppersmith Theorem
Coron, Jean-Sébastien UL; Kirichenko, Alexey; Tibouchi, Mehdi UL

in Journal of Cryptology (2013), 26(2), 246-250

Detailed reference viewed: 77 (2 UL)
Full Text
Peer Reviewed
See detailStructural Cryptanalysis of SASAS
Biryukov, Alex UL; Shamir, Adi

in Journal of Cryptology (2010), 23(4), 505-518

In this paper we consider the security of block ciphers which contain alternate layers of invertible S-boxes and affine mappings (there are many popular cryptosystems which use this structure, including ... [more ▼]

In this paper we consider the security of block ciphers which contain alternate layers of invertible S-boxes and affine mappings (there are many popular cryptosystems which use this structure, including the winner of the AES competition, Rijndael). We show that a five-layer scheme with 128-bit plaintexts and 8-bit S-boxes is surprisingly weak against what we call a multiset attack, even when all the S-boxes and affine mappings are key dependent (and thus completely unknown to the attacker). We tested the multiset attack with an actual implementation, which required just 2^16 chosen plaintexts and a few seconds on a single PC to find the 2^17 bits of information in all the unknown elements of the scheme. [less ▲]

Detailed reference viewed: 114 (3 UL)
Peer Reviewed
See detailCryptanalysis of ISO/IEC 9796-1
Coppersmith, Don; Coron, Jean-Sébastien UL; Grieu, François et al

in Journal of Cryptology (2008), 21(1), 2751

Detailed reference viewed: 46 (0 UL)
Full Text
Peer Reviewed
See detailFast Multiplication on Elliptic Curves over Small Fields of Characteristic Two
Müller, Volker UL

in Journal of Cryptology (1998), 11(4), 219-234

The paper shows how Frobenius expansions can be used to speed up mul­tiplication of points on elliptic curves that are defined over very small fields of charac­teristic two. The Frobenius expansion ... [more ▼]

The paper shows how Frobenius expansions can be used to speed up mul­tiplication of points on elliptic curves that are defined over very small fields of charac­teristic two. The Frobenius expansion algorithm is analyzed in theory and in practice. It can gain significant improvements in practical applica­tions. These curves are there­fore especially interesting for implementations of elliptic curve cryptosystems. [less ▲]

Detailed reference viewed: 106 (2 UL)