Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
691 results
-
-
Seminar
-
Cryptography
Cube Attacks on Tweakable Black Box Polynomials
Speaker : Adi Shamir - Weizmann Institute of Science
In this talk I will introduce a new kind of attack on cryptosystems which can be represented by an (unknown) low degree polynomial with tweakable public variables such as a plaintext or IV and fixed secret variables such as a key. Its complexity is exponential in the degree but only polynomial in the key size, and it was successfully applied to several concrete schemes. In particular, for Trivium[…] -
-
-
Seminar
-
Cryptography
A Residue Approach of the Finite Fields Arithmetics
Speaker : Jean-Claude Bajard - Université de Montpellier
Finite fields arithmetic is one of the challenges in current computer arithmetic. It occurs, in particular, in cryptography where the needs increase with the evolution of the technologies and also of the attacks. Through our research, we have proposed different systems based on residues representations. Different kinds of finite fields are concerned with. For each of them, some specificities of[…] -
-
-
Seminar
-
Cryptography
Recent results about side-channel attacks and countermeasures.
Speaker : François-Xavier Standaert - Université de Louvain
Traditionally, cryptographic algorithms provide security against an adversary who has only black box access to cryptographic devices. That is, the only thing the adversary can do is to query the cryptographic algorithm on inputs of its choice and analyze the responses, which are always computed according to the correct original secret information. However, such a model does not always correspond[…] -
-
-
Seminar
-
Cryptography
Généralisations multivariées de l'algorithme de Guruswami-Sudan
Speaker : Daniel Augot - INRIA
Dans cette présentation, je m'intéresserai aux généralisations de l'algorithme de Guruswami-Sudan. Il y a deux sortes de généralisations : celle de Parvaresh et Vardy, où l'on décode plusieurs mots en même temps, qui a culminé avec les codes de Guruswami et Rudra, qui atteignent la capacité du décodage en liste, sur des gros alphabets. Ce n'est pas cette généralisation qui m'intéresse. Je vais[…] -
-
-
Seminar
-
Cryptography
Les suites elliptiques à divisibilité.
Speaker : Valery Mahé - University of East Anglia
Les suites elliptiques à divisibilité sont un analogue, dans le cadre de la théorie des courbes elliptiques, des suites de Lucas et de Mersenne. De part leurs liens étroits avec les polynômes de division, les suites elliptiques à divisibilité et leurs généralisations ont des applications en cryptographie : étude par Shipsey du probleme du logarithme discret, algorithme de Stange pour le calcul[…] -
-
-
Seminar
-
Cryptography
The probability that a F_q-hypersurface is smooth
Speaker : Jeroen Demeyer - Universiteit Gent
Consider the projective space P^n over a finite field F_q. A hypersurface is defined by one homogenous equation with coefficients in F_q. For d going to infinity, we show that the probability that a hypersurface of degree d is nonsingular approaches 1/\zeta_{P^n (n+1)}. This is analogous to the well-known fact that the probability that an integer is squarefree equals 1/\zeta(2) = 6/\pi^2. This[…] -