Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
633 results
-
-
Seminar
-
Cryptography
On the design and implementation of scalar multiplication algorithms
Speaker : Koray Karabina - Florida Atlantic University
Diffie-Hellman type key exchange protocols and standardized digital signature algorithms all benefit from efficient design and secure implementation of group exponentiation algorithms. This talk will focus on elliptic curve groups and scalar multiplication algorithms derived from differential addition chains. First, I will give a survey of algorithms, and then I will present some recent[…] -
-
-
Seminar
-
Cryptography
Approx-SVP in Ideal Lattices with Pre-processing
Speaker : Alice Pellet-Mary - ENS de Lyon
Finding a short non zero vector in an Euclidean lattice is a well-studied problem which has proven useful to construct many cryptographic primitives. The current best asymptotic algorithm to find a relatively short vector in an arbitrary lattice is the BKZ algorithm. This algorithm recovers a vector which is at most $2^{n^{\alpha}}$ times larger than the shortest non zero vector in time $2^{n^{1-[…] -
-
-
Seminar
-
Cryptography
Some new results on cube attacks against Trivium
Speaker : Tian Tian - Université de Zhengzhou
Trivium is a bit oriented synchronous stream cipher designed by Cannière and Preneel. It is one of the eSTREAM hardware-oriented finalists and an International Standard under ISO/IEC 29192-3:2012. Cube attacks are an important type of key recovery attack against Trivium. First, I will give a survey on cube attacks against Trivium. Second, I will present our recent results including an algebraic[…] -
-
-
Seminar
-
Cryptography
Cryptanalyse algébrique de DAGS
Speaker : Magali Bardet - université de Rouen
Elise Barelli et Alain Couvreur ont présenté une attaque dévastatrice sur le cryptosystème DAGS soumis au 1er tour de la compétition du NIST autour d'algorithmes de cryptographie post-quantiques. Je présenterai une explication précise de la résolution par bases de Gröbner de leur modélisation algébrique, expliquant l'efficacité de l'attaque pour les paramètres de DAGS publiés au[…] -
-
-
Seminar
-
Cryptography
Grost Distinguishing Attack: A new rebound attack of an AES-like permutation
Speaker : Victor Cauchois - DGA et IRMAR
Grostl est une fonction de hachage finaliste de la compétition SHA-3. Elle est dotée d'une preuve de sécurité qui assure sa résistance aux attaques en collision, pré-image et seconde pré-image sous l'hypothèse que deux permutations internes sont idéales. Ces permutations, 14 tours d'un SPN, calques de l'AES, présentent une structure sensible aux attaques rebond. Ces attaques[…] -
-
-
Seminar
-
Cryptography
Discrete logarithm computation in finite fields GF(p^k) with NFS
Speaker : Aurore Guillevic - INRIA
Pairings on elliptic curves are involved in signatures, NIZK, and recently in blockchains (ZK-SNARKS).<br/> These pairings take as input two points on an elliptic curve E over a finite field, and output a value in an extension of that finite field. Usually for efficiency reasons, this extension degree is a power of 2 and 3 (such as 12,18,24), and moreover the characteristic of the finite[…] -