Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
688 results
-
-
Seminar
-
Cryptography
Middle-Product Learning With Errors
Speaker : Miruna Rosca - ENS de Lyon
We introduce a new variant MP-LWE of the Learning With Errors problem (LWE) making use of the Middle Product between polynomials modulo an integer q. We exhibit a reduction from the Polynomial-LWE problem (PLWE) parametrized by a polynomial f, to MP-LWE which is defined independently of any such f. The reduction only requires f to be monic with constant coefficient coprime with q. It incurs a noise[…] -
-
-
Seminar
-
Cryptography
Improving greedy nonrandomness detectors for stream ciphers
Speaker : Paul Stankovski - Université de Lund
We consider the problem of designing distinguishers and nonrandomness detectors for stream ciphers using the maximum degree monomial test. We construct an improved algorithm to determine the subset of key and IV-bits used in the test. The algorithm is generic, and can be applied to any stream cipher. In addition to this, the algorithm is highly tweakable, and can be adapted depending on the[…] -
-
-
Seminar
-
Cryptography
Towards the Implementation of Efficient and Distributable Pairing-based Crypto Library
Speaker : Al-Amin Khandaker - Okayama University
Pairing-based cryptography is popular among the cryptographic protocol researchers for its eccentric provable security. Protocol side researchers often see pairing as a black box. They often need to test the correctness of their proposal. Typically, mathematicians and cryptography engineers try to make the underlying operations of pairing-based crypto efficient. In addition, different types of[…] -
-
-
-
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[…] -
-
-
Seminar
-
Cryptography
Computing individual discrete logarithms in non-prime finite fields
Speaker : Aurore Guillevic - Inria Saclay, équipe Grace et Ecole Polytechnique, LIX
This talk is about computing discrete logarithms in non-prime finite fields. These fields arise in pairing-based cryptography. In this setting, the pairing-friendly curve is defined over GF(q) and the pairing takes its values in an extension GF(q^k), where k is the embedding degree.<br/> Fr example, GF(p^2) is the embedding field of supersingular elliptic curves in large characteristic; GF(p^3),[…] -