Description
Les chiffrements de flot (stream ciphers) codent les symboles individuels (généralement les chiffres binaires) un a un, en utilisant une transformation de chiffrement qui varie dans le temps. Les chiffrements de flux sont généralement plus rapides sur le matériel, et leurs architectures sont moins complexes. Ils sont plus appropries, et dans certains cas obligatoires (p.e. dans certaines applications dans les télécommunications), quand la taille du tampon est limitée, quand les symboles doivent être traites individuellement des l'arrivée, ou encore quand le nombre d'erreurs de transmission est élevé.<br/> Dans cet expose, nous présenterons les principes généraux de construction des chiffrements de flot, leurs avantages et leurs inconvénients. L'accent sera mis sur les chiffrements synchrones bases sur les registres a décalage, ainsi que sur les techniques d'analyse de complexité et de sécurité de ces chiffrements.
Next sessions
-
Verification of Rust Cryptographic Implementations with Aeneas
Speaker : Aymeric Fromherz - Inria
From secure communications to online banking, cryptography is the cornerstone of most modern secure applications. Unfortunately, cryptographic design and implementation is notoriously error-prone, with a long history of design flaws, implementation bugs, and high-profile attacks. To address this issue, several projects proposed the use of formal verification techniques to statically ensure the[…] -
On the average hardness of SIVP for module lattices of fixed rank
Speaker : Radu Toma - Sorbonne Université
In joint work with Koen de Boer, Aurel Page, and Benjamin Wesolowski, we study the hardness of the approximate Shortest Independent Vectors Problem (SIVP) for random module lattices. We use here a natural notion of randomness as defined originally by Siegel through Haar measures. By proving a reduction, we show it is essentially as hard as the problem for arbitrary instances. While this was[…] -
Lightweight (AND, XOR) Implementations of Large-Degree S-boxes
Speaker : Marie Bolzer - LORIA
The problem of finding a minimal circuit to implement a given function is one of the oldest in electronics. In cryptography, the focus is on small functions, especially on S-boxes which are classically the only non-linear functions in iterated block ciphers. In this work, we propose new ad-hoc automatic tools to look for lightweight implementations of non-linear functions on up to 5 variables for[…]-
Cryptography
-
Symmetrical primitive
-
Implementation of cryptographic algorithm
-
-
Endomorphisms via Splittings
Speaker : Min-Yi Shen - No Affiliation
One of the fundamental hardness assumptions underlying isogeny-based cryptography is the problem of finding a non-trivial endomorphism of a given supersingular elliptic curve. In this talk, we show that the problem is related to the problem of finding a splitting of a principally polarised superspecial abelian surface. In particular, we provide formal security reductions and a proof-of-concept[…]-
Cryptography
-