Some easy instances of ideal-SVP and implications on the partial Vandermonde Knapsack problem

K Boudgoust, E Gachon, A Pellet-Mary - Annual International Cryptology …, 2022 - Springer
In this article, we generalize the works of Pan et al.(Eurocrypt'21) and Porter et al.(ArXiv'21)
and provide a simple condition under which an ideal lattice defines an easy instance of the …

Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems

K Boudgoust, A Sakzad, R Steinfeld - Designs, Codes and Cryptography, 2022 - Springer
PASS Encrypt is a lattice-based public key encryption scheme introduced by Hoffstein and
Silverman (Des Codes Cryptogr 77 (2–3): 541–552, 2015). The efficiency and algebraic …

Key Recovery Attack on the Partial Vandermonde Knapsack Problem

D Das, A Joux - Annual International Conference on the Theory and …, 2024 - Springer
Abstract The Partial Vandermonde (PV) Knapsack problem is an algebraic variant of the low-
density inhomogeneous SIS problem. The problem has been used as a building block for …

A differential fault attack against deterministic falcon signatures

S Bauer, F De Santis - International Conference on Smart Card Research …, 2023 - Springer
We describe a fault attack against the deterministic variant of the FALCON signature
scheme. It is the first fault attack that exploits specific properties of deterministic FALCON …

An improved cryptanalysis of large RSA decryption exponent with constrained secret key

M Mumtaz, L Ping - International Journal of Information and …, 2021 - inderscienceonline.com
In this study, we revisit the RSA public key cryptosystem in some special case of Boneh and
Durfee's attack when the private key d assumes to be larger than the public key e. The attack …

[PDF][PDF] Structured Codes for Cryptography: from Source of Hardness to Applications

M BOMBAR - 2023 - maximebombar.fr
Remote communications are taking more and more importance in our everyday lives: from
accessing our bank accounts and health data, communicating with family, friends and co …

Codes Structurés pour la Cryptographie: des Fondations Théoriques de la Sécurité aux Applications

M Bombar - 2023 - inria.hal.science
Dans cette thèse, nous nous intéressons à la cryptographie fondée sur les codes
correcteurs d'erreurs, et plus particulièrement sur ceux possédant une forte structure …

Theoretical hardness of algebraically structured learning with errors

K Boudgoust - 2021 - theses.hal.science
The main focus of this Ph. D thesis lies on the computational problem Learning With Errors
(LWE). It is a core building block of lattice-based cryptography, which itself is among the …