Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
633 results
-
-
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
Beyond the black and grey box
Speaker : Yoni De Mulder - University of Leuven
In the white-box attack context, i.e., the setting where an implementation of a cryptographic algorithm is executed on an untrusted open platform, the adversary has full access to the implementation and its execution environment. As a result, the adversary is much more powerful than in a traditional black-box environment in which the adversary has only access to the inputs and outputs of a[…] -
-
-
Seminar
-
Cryptography
Cyclic and quasi-cyclic separable Goppa codes
Speaker : Sergey Bezzateev - Université d'État de Saint-Pétersbourg
Overview of recent results in constructions of cyclic and quasi-cyclic Goppa codes. Classical and generalized Goppa codes are considered. Subclasses of embedded optimal quasi-cyclic Goppa codes with improvement parameters are presented. -
-
-
Seminar
-
Cryptography
Chiffrement (complètement) homomorphe : de la théorie à la pratique
Speaker : Tancrède Lepoint - CryptoExperts
Le chiffrement complètement homomorphe (parfois considéré comme le Saint Graal de la cryptographie) permet d'effectuer (de façon publique) des calculs arbitraires sur des messages chiffrés. Les premières instanciations de cette surprenante primitive ne peuvent être considérées comme pratiques, chaque multiplication de deux bits chiffrés nécessitant d'être suivie par une procédure de plusieurs[…] -
-
-
Seminar
-
Cryptography
On Error Correction for Physical Unclonable Functions
Speaker : Sven Muelich - Institute of Communications Engineering, Ulm University
Cryptographic applications require random, unique and unpredictable keys. Since most cryptosystems need to access the key several times, it usually has to be stored permanently. This is a potential vulnerability regarding security, even if a protected memory is used as key storage. Implementing secure key generation and storage is therefore an important and challenging task which can be[…] -
-
-
Seminar
-
Cryptography
Utilisation des symétries pour la résolution du problème de
Speaker : Louise Huot - LIP6
Récemment Diem et Gaudry ont introduit indépendemment une méthode de résolution du DLP sur les courbes elliptiques définies sur un corps fini non premier K, de degré d'extension n > 1 sur le corps de base k. Cet algorithme repose sur le principe général du calcul d'indice. Une étape cruciale de cet algorithme nécessite de décomposer des points de la courbe E(K) selon une base de facteurs. C'est à[…] -