Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
652 results
-
-
Seminar
-
Cryptography
Candidats NIST basés sur les réseaux: choix de conception et astuces de ninja
Speaker : Thomas Prest. - PQShield
Parmi les 26 schémas post-quantique toujours considérés pour standardisation par le NIST, 12 sont basés sur les réseaux (3 schémas de signature et 9 schémas de chiffrement). Cette présentation leur est consacrée. A haut niveau, tous peuvent être interprétés comme des instanciations directes de paradigmes bien établis. Mais une analyse plus attentive révèle que chacun d'eux fait des choix de[…] -
-
-
Seminar
-
Cryptography
Quantum cryptanalysis of block ciphers: beyond quadratic speedups
Speaker : André Schrottenloher - CWI
The security of modern cryptosystems relies on computational assumptions, which may be challenged by the advent of large-scale quantum computing devices.<br/> While Shor's algorithm is known to break today's most popular public-key schemes, secret-key cryptosystems are generally expected to retain half of their pre-quantum bits of security. However, the precise advantage of quantum attacks cannot[…] -
-
-
Seminar
-
Cryptography
co-organisée avec le séminaire sécurité des systèmes électroniques embarqués
Speaker : mot de passe: 344005 - très classe le mot de passe en clair !
https://seminaires-dga.inria.fr/securite-elec/<br/> lien: https://bbb.irisa.fr/b/ger-mvp-9xd -
-
-
Seminar
-
Cryptography
TBA
Speaker : Louiza Khati - Anssi
TBA lien: https://univ-rennes1-fr.zoom.us/j/97066341266?pwd=RUthOFV5cm1uT0ZCQVh6QUcrb1drQT09 -
-
-
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-[…] -