Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
722 results
-
-
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
Disjunctions for Hash Proof Systems: New Constructions and Applications
Speaker : 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[…] -
-
-
Seminar
-
Cryptography
Points rationnels sur une surface cubique
Speaker : Jenny Cooley - University of Warwick
Soit F_q un corps fini à au moins 13 éléments. Soit S une surface cubique non singulière sur laquelle il y a au moins une droite rationnelle incluse. Il existe une façon de générer les points rationnels en utilisant des opérations tangentes et sécantes qui est similaire à la loi de composition du groupe de points d'une courbe elliptique. Dans cet exposé, nous utilisons le principe des tiroirs pour[…] -
-
-
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
A heuristic quasi-polynomial algorithm for discrete logarithm
Speaker : Razvan Basbulescu - LORIA
in finite fields of small characteristic The difficulty of discrete logarithm computations in fields GF(q^k) depends on the relative sizes of k and q. Until recently all the cases had a sub-exponential complexity of type L(1/3), similar to the complexity of factoring. If n is the bit-size of q^k, then L(1/3) can be approximated by 2^(n^(1/3)). In 2013, Joux designed a new algorithm for constant[…] -
-
-
Seminar
-
Cryptography
Tours ordinaires de corps de fonctions et rang de tenseur de la multiplication dans les extensions de F_2 et F_3
Speaker : Julia Pieltant - LIX
On s'intéresse dans cet exposé au rang de tenseur de la multiplication dans les extensions finies de F_q, qui correspond à la complexité bilinéaire sur F_q de la multiplication dans F_{q^n}.<br/> Dans cette optique, on présentera l'algorithme introduit en 1987 par D.V. et G.V. Chudnovsky qui a permis d'établir la linéarité du rang de tenseur en le degré n de l'extension considérée, et en fournit[…] -