Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
In 2002, Murphy and Robshaw introduced an extension BES of AES and argued this could compromise the security of AES. We introduce here two block-ciphers CES and big-BES that are some extensions of the AES and BES respectively in the spirit of Hensel liftin ...
Knapsack-based cryptosystems used to be popular in the beginning of public key cryptography before all but the Chor-Rivest cryptosystem (B. Chor and R.L. Rivest, 1985) was broken. The article demonstrates how to break this one with its suggested parameters ...
Contact of rough surfaces is of prime importance in the study of friction and wear. Numerical simulations are well suited for this non-linear problem, but natural surfaces being fractal [1], they have high discretization requirements. There is therefore a ...
Over the field of complex numbers, it is well-known that if the input is real then it is possible to compute 2 real DFT's with one complex DFT. We extend the result to finite fields and show how to compute m DFT's over GF(q) with one DFT over GF(qm) ...
1993
Recently, we showed how to strengthen block ciphers by decorrelation techniques. In particular, we proposed two practical block ciphers, one based on the GF(2n)-arithmetics, the other based on the x mod p mod 2n primitive with a prime ...
We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of very smooth numbers modulo an S-bit composite. By very smooth, we mean that the smoothnes ...
An oblivious linear function evaluation protocol, or OLE, is a two-party protocol for the function f (x) = ax + b, where a sender inputs the field elements a, b, and a receiver inputs x and learns f (x). OLE can be used to build secret-shared multiplicatio ...
The Boolean lattice (2[n],subset of) is the family of all subsets of [n]={1,MIDLINE HORIZONTAL ELLIPSIS,n}, ordered by inclusion. Let P be a partially ordered set. We prove that if n is sufficiently large, then there exists a packing P of copies of P in (2 ...
WILEY2020
Knapsack-based cryptosystems used to be popular in the beginning of public key cryptography before being all broken, all but the Chor-Rivest cryptosystem. We show how to break this one with its suggested parameters: GF(p24) and GF(25625
