On the hardness of the hidden subset sum problem: algebraic and statistical attacks

Doctoral thesis (Dissertations and theses)

Gini, Agnese

2022

Permalink
https://hdl.handle.net/10993/51778

Gini_PhD.pdf

Author postprint (1.26 MB)

All documents in ORBilu are protected by a user license.

Keywords :

Cryptanalysis; Mathematical cryptology; Statistical attack; Lattices; Public-key cryptography; Subset-sum problem; Multivariate systems

Disciplines :

Computer science

Author, co-author :

Gini, Agnese ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > PI Coron

Language :

English

Title :

On the hardness of the hidden subset sum problem: algebraic and statistical attacks

Defense date :

07 July 2022

Institution :

Unilu - University of Luxembourg, Luxembourg

Degree :

Docteur en Informatique

Promotor :

Available on ORBilu :

since 25 July 2022

Number of views

193 (30 by Unilu)

Number of downloads

185 (13 by Unilu)