Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
760 results
-
-
Seminar
-
Cryptography
Power decoding of Hermitian codes in sub-quadratic time
Speaker : Johan Nielsen - INRIA Saclay Ile de France
Reed-Solomon codes have optimal minimum distance and we know efficient encoding and decoding algorithms of quasi-linear complexity in the length. Their main drawback is that their lengths are bounded by the size of the alphabet, i.e. the field over which they are defined. Algebraic geometry codes are a generalisation allowing longer codes on the same alphabet, and one of the most interesting sub[…] -
-
-
Seminar
-
Cryptography
Keep your friends close with distance-bounding protocols
Speaker : Maria Cristina Onete - IRISA
Authentication protocols, run between a prover and a verifier, allow the verifier to check the legitimacy of the prover. A legitimate prover should always authenticate (the correctness requirement), while illegitimate parties (adversaries) should not authenticate (the soundness or impersonation resistance requirement). Secure authentication protocols thwart most Man-in-the-Middle (MIM) attacks,[…] -
-
-
Seminar
-
Cryptography
Comparaison de la factorisation d'entiers et du logarithme
Speaker : Pierrick Gaudry - LORIA
Le crible algébrique est le meilleur algorithme connu pour factoriser les entiers et pour calculer des logarithmes discrets dans des corps finis de grande caractérsitique. Bien que la complexité théorique est la même dans les deux cas, la phase d'algèbre linéaire est bien plus difficile dans le cas du logarithme discret. En revanche, les corps finis non premiers ont plus de structure, si bien que[…] -
-
-
Seminar
-
Cryptography
Functional Encryption: A novel paradigm for public-key encryption.
Speaker : Angelo De Caro - ENS
Whereas, in traditional public-key encryption, decryption is an all-or-nothing affair (i.e., a receiver is either able to recover the entire message using its key, or nothing), functional encryption enables fine-grained access control and computation on encrypted data, as required to protect data in the cloud.<br/> In the first part of the talk, we provide an introduction to functional encryption[…] -
-
-
Seminar
-
Cryptography
Un algorithme pour trouver toutes les formules calculant une application bilinéaire.
Speaker : Nicolas Estibal - IRISA
La multiplication est une opération arithmétique coûteuse comparativement à l'addition. Aussi il est intéressant, étant donné une application, de minimiser le nombre de produits à effectuer pour la calculer. Dans cette étude, nous nous restreignons au cas des applications bilinéaires.<br/> En effet, parmi les applications bilinéaires, nous étions intéressés en premier lieu par la multiplication[…] -
-
-
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. -