Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
633 results
-
-
Seminar
-
Cryptography
Rencontre au milieu avec match box sur KATAN
Speaker : Brice Minaud - ANSSI
Les attaques par rencontre au milieu ont connu un regain d'intérêt notamment à cause des chiffrements légers, qui s'y prêtent mieux que les chiffrements traditionnels. Cela a amené au développement de nouvelles variantes et améliorations de ces attaques. On présente ici une nouvelle technique pour augmenter le nombre de tours couverts par une rencontre au milieu. On l'applique ensuite à une[…] -
-
-
Seminar
-
Cryptography
Relations entre les généralisations de la cryptanalyse différentielle et de la cryptanalyse linéaire.
Speaker : Céline Blondeau - Aalto
Durant les 25 dernières années, plusieurs généralisations de la cryptanalyse différentielle et de la cryptanalyse linéaire ont été proposées et ont permis d'attaquer un certain nombre de systèmes de chiffrement symétrique. Dans cet exposé, nous décrirons ces attaques et nous expliquerons les récents liens qui ont été trouvés entre différentes attaques de ces deux familles. En particulier nous[…] -
-
-
Seminar
-
Cryptography
Power decoding of Hermitian codes in sub-quadratic time
Speaker : Johan Nielsen - INRIA Saclay Ile de France
Reed-Solomon codes have optimal minimum distance and we know efficient encoding and decoding algorithms of quasi-linear complexity in the length. Their main drawback is that their lengths are bounded by the size of the alphabet, i.e. the field over which they are defined. Algebraic geometry codes are a generalisation allowing longer codes on the same alphabet, and one of the most interesting sub[…] -
-
-
Seminar
-
Cryptography
Same-Values Analysis on Elliptic Curve Cryptography
Speaker : Cédric Murdica - Secure-IC
Elliptic Curve Cryptography (ECC) is believed to be unbreakable in the black box model, where the cryptanalyst has access to inputs and outputs only. However, it is not enough if the cryptosystem is embedded on a device that is physically accessible to potential attackers. In addition to inputs and outputs, the attacker can study the physical behaviour of the device such as the execution time or[…] -
-
-
Seminar
-
Cryptography
Cryptanalysis of Round-Reduced PRINCE and TWINE
Speaker : Patrick Derbez - Luxembourg
NXP Semiconductors and its academic partners challenged the cryptographic community with finding practical attacks on the block cipher they designed, PRINCE. In the first part of this talk we present new attacks on round-reduced PRINCE including the ones which won the challenge in the 6 and 8-round categories --- the highest for which winners were identified. Our first attacks rely on a meet-in[…] -
-
-
Seminar
-
Cryptography
A heuristic quasi-polynomial algorithm for discrete logarithm
Speaker : Razvan Basbulescu - LORIA
in finite fields of small characteristic The difficulty of discrete logarithm computations in fields GF(q^k) depends on the relative sizes of k and q. Until recently all the cases had a sub-exponential complexity of type L(1/3), similar to the complexity of factoring. If n is the bit-size of q^k, then L(1/3) can be approximated by 2^(n^(1/3)). In 2013, Joux designed a new algorithm for constant[…] -