523 results
-
Discrete logarithm computation in finite fields GF(p^k) with NFS
Speaker : Aurore Guillevic - INRIA
Pairings on elliptic curves are involved in signatures, NIZK, and recently in blockchains (ZK-SNARKS).<br/> These pairings take as input two points on an elliptic curve E over a finite field, and output a value in an extension of that finite field. Usually for efficiency reasons, this extension degree is a power of 2 and 3 (such as 12,18,24), and moreover the characteristic of the finite field has[…] -
Number Systems and Cryptography, some examples
Speaker : Jean-Claude Bajard - Sorbonne Université
Number systems are behind a lot of implementations. The role of representation is often underrated while its importance in implementation is crucial. We survey here some classes of fundamental systems that could be used in crypotgraphy. We present three main categories:<br/> - systems based on the Chinese Remainder Theorem which enter more generally in the context of polynomial interpolation,<br/[…] -
CSIDH: an efficient post-quantum commutative group action
Speaker : Chloé Martindale - Technical University of Eindhoven
CSIDH, or `commutative supersingular isogeny Diffie-Hellman' is a new isogeny-based protocol of Castryck, Lange, Martindale, Panny, and Renes.<br/> The Diffie-Hellman style scheme resulting from the group action allows for public key validation at very little cost, runs reasonably fast in practice, and has public keys of only 64 bytes at a conjectured AES-128 security level, matching NIST’s post[…] -
Towards Non-Interactive Zero-Knowledge from CDH and LWE
Speaker : Geoffroy Couteau - Karlsruher Institut für Technologie (KIT)
We provide a generic construction of non-interactive zero-knowledge (NIZK) schemes. Our construction is a refinement of Dwork and Naor’s (FOCS 2000) implementation of the hidden bits model using verifiable pseudorandom generators (VPRGs). Our refinement simplifies their construction and relaxes the necessary assumptions considerably. As a result of this conceptual improvement, we obtain[…] -
Wave: A New Code-Based Signature Scheme
Speaker : Thomas Debris-alazard - inria
It is a long standing open problem to build an efficient and secure digital signature scheme based on the hardness of decoding a linear code which could compete with widespread schemes like DSA or RSA. The latter signature schemes are broken by a quantum computer with Shor’s algorithm. Code-based schemes could provide a valid quantum resistant replacement. We present here Wave the first « hash[…] -
Some new results on cube attacks against Trivium
Speaker : Tian Tian - Université de Zhengzhou
Trivium is a bit oriented synchronous stream cipher designed by Cannière and Preneel. It is one of the eSTREAM hardware-oriented finalists and an International Standard under ISO/IEC 29192-3:2012. Cube attacks are an important type of key recovery attack against Trivium. First, I will give a survey on cube attacks against Trivium. Second, I will present our recent results including an algebraic[…]