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

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


	Document type :	Dissertations and theses : Doctoral thesis
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/51778

Title :	On the hardness of the hidden subset sum problem: algebraic and statistical attacks
Language :	English
Author, co-author :	Gini, Agnese [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > PI Coron >]
Publication date :	7-Jul-2022
Institution :	University of Luxembourg, Luxembourg
Name of the degree :	Docteur en Informatique
Supervisor :	Coron, Jean-Sébastien
Keywords :	[en] Cryptanalysis ; Mathematical cryptology ; Statistical attack ; Lattices ; Public-key cryptography ; Subset-sum problem ; Multivariate systems
Permalink :	http://hdl.handle.net/10993/51778

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	Gini_PhD.pdf		Author postprint	1.24 MB	View/Open

All documents in ORBi^lu are protected by a user license.