Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
688 results
-
-
Seminar
-
Cryptography
Simplified Settings for Discrete Logarithms in Small Characteristic Finite Fields
Speaker : Cécile Pierrot - UPMC LIP6
Public key cryptography is based on hard problems, such as the discrete logarithm problem (DLP). In this talk, I focus on the discrete logarithm problem in finite fields:<br/> Given GF(q^k) and a generator g of GF(q^k)*, we say that we solve the DLP in GF(q^k) if, for any arbitrary element h in GF(q^k)*, we are able to recover an integer x such that: g^x = h. When the characteristic is small[…] -
-
-
-
Seminar
-
Cryptography
New multilinear maps over the integers
Speaker : Jean-Sébastien Coron - Université du Luxembourg
In the last few years, cryptographic multilinear maps have proved their tremendous potential as building blocks for new constructions, in particular the first viable approach to general program obfuscation. After the first candidate construction by Garg, Gentry and Halevi (GGH) based on ideal lattices, a second construction over the integers was described by Coron, Lepoint and Tibouchi (CLT).[…] -
-
-
Seminar
-
Cryptography
Finding ECM-Friendly Curves through a Study of Galois Properties
Speaker : Cyril Bouvier - Institut de mathématiques de Bordeaux
In this talk, I'll prove some divisibility properties of the cardinality of elliptic curve groups modulo primes. These proofs explain the good behavior of certain parameters when using Montgomery or Edwards curves in the setting of the elliptic curve method (ECM) for integer factorization. The ideas behind the proofs can be used to find new infinite families of elliptic curves with good division[…] -
-
-
Seminar
-
Cryptography
Construction d'une petite boite S 8-bit avec branchement 3 (&applications)
Speaker : Pierre Karpman - Rennes 1 et Singapour
Je présenterai la construction et l'implémentation d'une boîte S sur 8 bits qui a un branchement linéaire et différentiel de 3. Je montrerai une application en construisant un chiffre par bloc sur 64 bits dont la structure est très simple et basée sur l'évaluation en tranches (bitsliced) et des rotations sur mots de 8 bits. La fonction de tour de ce chiffre peut s'implémenter avec le même nombre d[…] -
-