Learn More
This paper presents a variety of plaintext-recovering attacks against SSH. We implemented a proof of concept of our attacks against OpenSSH, where we can verifiably recover 14 bits of plaintext from an arbitrary block of ciphertext with probability $2^{-14}$ and 32 bits of plaintext from an arbitrary block of ciphertext with probability $2^{-18}$. These(More)
The Learning with Errors (LWE) problem has become a central building block of modern cryptographic constructions. This work collects and presents hardness results for concrete instances of LWE. In particular, we discuss algorithms proposed in the literature and give the expected resources required to run them. We consider both generic instances of LWE as(More)
Designing an efficient cipher was always a delicate balance between linear and non-linear operations. This goes back to the design of DES, and in fact all the way back to the seminal work of Shannon. Here we focus, for the first time, on an extreme corner of the design space and initiate a study of symmetric-key primitives that minimize the multiplicative(More)
The subfield attack exploits the presence of a subfield to solve overstretched versions of the NTRU assumption: norming the public key h down to a subfield may lead to an easier lattice problem and any sufficiently good solution may be lifted to a short vector in the full NTRU-lattice. This approach was originally sketched in a paper of Gentry and Szydlo at(More)
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion(More)
Bellare and Kohno introduced a formal framework for the study of related-key attacks against blockci-phers. They established sufficient conditions (output-unpredictability and collision-resistance) on the set of related-key-deriving (RKD) functions under which an ideal cipher is secure against related-key attacks, and suggested this could be used to derive(More)
We analyse the complexity of algebraic algorithms for solving systems of linear equations with noise. Such systems arise naturally in the theory of error-correcting codes as well as in computational learning theory. More recently, linear systems with noise have found application in cryptography. The Learning with Errors (LWE) problem has proven to be a rich(More)
We provide constructions of multilinear groups equipped with natural hard problems from indistinguishability obfuscation, homomor-phic encryption, and NIZKs. This complements known results on the constructions of indistinguishability obfuscators from multilinear maps in the reverse direction. We provide two distinct, but closely related constructions and(More)
A series of PEPPSI-type palladium(II) complexes was synthesized that contain 3-chloropyridine as an easily removable ligand and a triazolylidene as a strongly donating mesoionic spectator ligand. Catalytic tests in Suzuki-Miyaura cross-coupling reactions revealed the activity of these complexes towards aryl bromides and aryl chlorides at moderate(More)
The [3 + 2] cycloaddition of azides and acetylenes followed by nitrogen quaternization was applied for the generation of novel and highly modular triazolium salts. The selective substitution of the 1,3,4-substitution pattern presets such salts as precursors for a new class of abnormal carbene ligands, thus expanding the family of these high-impact ligands.(More)