511 results
-
Class Group Computations in Number Fields and Applications to Cryptology
Speaker : Alexandre Gelin - Versailles-Saint-Quentin-en-Yvelines
In this talk, we focus on class group computations in number fields. We start by describing an algorithm for reducing the size of a defining polynomial of a number field. There exist infinitely many polynomials that define a specific number field, with arbitrarily large coefficients, but our algorithm constructs the one that has the absolutely smallest coefficients. The advantage of knowing such a[…] -
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[…] -
Lilliput: Advances in Security and Performance Analysis
Speaker : Julien Francq - Airbus CyberSecurity
Lilliput is a block cipher that has been published in 2015 in IEEE Transactions in Computers with Thierry Berger and Marine Minier, and the seminal paper has been cited 6 times for now. This talk will summarize the results of the third-party cryptanalysis and implementations, and will show that Lilliput is still an efficient and secure cryptographic primitives. -
CRYSTALS: Dilithium and Kyber
Speaker : Damien Stehlé - ENS de Lyon
Kyber -- a Key Exchange Mechanism -- and Dilithium -- a digital signature -- are the two components of the Cryptographic Suite for Algebraic Lattices (CRYSTALS). I will present the intractable problems underlying their security, overview their design and comment their practical performance. The talk is based on the following articles:<br/> https://eprint.iacr.org/2017/633.pdf<br/&gt;[…] -
Investigating LWE without Modular Reduction
Speaker : Jonathan Bootle - UCL
The LWE problem is ubiquitous in lattice cryptography. In order to try and design more efficient cryptosystems, an increasing number of LWE variants are being considered. In this talk, we consider a variant of LWE over the integers i.e. without modular reduction. We explain why the problem is easy to solve with a large number of samples, and show how this leads to a side-channel attack on the[…] -
Locally recoverable codes from curves
Speaker : Everett Howe - Center for Communications Research, San Diego
A locally recoverable code, or LRC, is a code over a finite alphabet such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. I will explain why LRCs are important for applications such as cloud data storage, and I will present several constructions of locally recoverable codes from Galois covers of curves over finite[…]