627 results
-
Cryptanalyse algébrique de DAGS
Speaker : Magali Bardet - université de Rouen
Elise Barelli et Alain Couvreur ont présenté une attaque dévastatrice sur le cryptosystème DAGS soumis au 1er tour de la compétition du NIST autour d'algorithmes de cryptographie post-quantiques. Je présenterai une explication précise de la résolution par bases de Gröbner de leur modélisation algébrique, expliquant l'efficacité de l'attaque pour les paramètres de DAGS publiés au NIST.<br/> lien:[…] -
Unifying Leakage Models on a Renyi Day
Speaker : Thomas Prest - PqShield
In the last decade, several works have focused on finding the best way to model circuit leakage in order to obtain provably secure implementations. One of the most realistic models is the noisy leakage model, introduced in (Prouff, Rivain'13) and (Duc-Dziembowski-Faust'14) together with secure constructions. These works suffer from various limitations, in particular the use of ideal leak-free[…] -
Cocks-Pinch curves of embedding degree five to eight and optimal ate pairing computation
Speaker : Simon Masson - Loria, Nancy
Recent algorithmic improvements of discrete logarithm computation in special extension fields threaten the security of pairing-friendly curves used in practice. A possible answer to this delicate situation is to propose alternative curves that are immune to these attacks, without compromising the efficiency of the pairing computation too much. We follow this direction, and focus on embedding[…] -
Laser-Based Attacks Against FPGA Bitstream Encryption
Speaker : Heiko Lohrke
Field programmable gate arrays (FPGAs) use encryption to protect the configuration data or “bitstream” containing the design to be run on the device. This encryption aims at protecting the intellectual property and other secrets contained in the bitstream and preventing e.g. cloning or tampering with an FPGA implementation.This talk will demonstrate how attackers can use failure analysis equipment[…] -
Challenges related to random number generation for cryptographic applications
Speaker : Elie Noumon Allini
The main purpose of cryptography is to ensure secure communication. In order to achieve this goal, cryptographic schemes make an intensive use of random numbers. Given that the security of these schemes highly depends on these numbers, it is important to produce high-quality random numbers. Knowing that most cryptographic modules are nowadays implemented in logic devices, we investigated True[…] -
Improved Veron Identification and Signature Schemes in the Rank Metric
Speaker : Florian Caullery - Darkmatter
Abstract—It is notably challenging to design an efficient and secure signature scheme based on error-correcting codes. An approach to build such signature schemes is to derive it from an identification protocol through the Fiat-Shamir transform.<br/> All such protocols based on codes must be run several rounds, since each run of the protocol allows a cheating probability of either 2/3 or 1/2. The[…]