Filtrer par type de contenu
Sélectionnez un ou plusieurs filtres. Ce choix permettra de recharger la page pour afficher les résultats filtrés.
721 résultats
-
-
Séminaire
-
Cryptographie
Learning with Errors in the Exponent
Orateur : özgür Dagdelen - Darmstadt University
We initiate the study of a novel class of group-theoretic intractability problems. Inspired by the theory of learning in presence of errors [Regev, STOC'05] we ask if noise in the exponent amplifies intractability. We put forth the notion of Learning with Errors in the Exponent (LWEE) and rather surprisingly show that various attractive properties known to ex- clusively hold for lattices carry[…] -
-
-
Séminaire
-
Cryptographie
Cyclic and quasi-cyclic separable Goppa codes
Orateur : 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. -
-
-
Séminaire
-
Cryptographie
Disjunctions for Hash Proof Systems: New Constructions and Applications
Orateur : Fabrice Ben Hamouda - ENS
Hash Proof Systems were first introduced by Cramer and Shoup (Eurocrypt'02) as a tool to construct efficient chosen-ciphertext-secure encryption schemes. Since then, they have found many other applications, including password authenticated key exchange, oblivious transfer, and zero-knowledge arguments. One of the aspects that makes hash proof systems so interesting and powerful is that they can be[…] -
-
-
Séminaire
-
Cryptographie
Beyond the black and grey box
Orateur : 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[…] -
-
-
Séminaire
-
Cryptographie
On Error Correction for Physical Unclonable Functions
Orateur : 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[…] -
-
-
Séminaire
-
Cryptographie
L1 a new quasi-linear LLL algorithm
Orateur : Andy Novocin - ENS Lyon
The LLL lattice reduction algorithm of 1982 has proven to be useful in a wide variety of fields. It can be used to approximately solve computationally difficult lattice-based problems, such as the shortest vector problem, in polynomial time. We present a new algorithm for lattice reduction which is the first algorithm to have a complexity bound which is both polynomial and quasi-linear bound in[…] -