Login
EN
[EN] English
[FR] Français
Login
EN
[EN] English
[FR] Français
Give us feedback
Search and explore
Search
Explore ORBilu
Open Science
Open Science
Open Access
Research Data Management
Definitions
OS Working group
Webinars
Statistics
Help
User Guide
FAQ
Publication list
Document types
Reporting
Training
ORCID
About
About ORBilu
Deposit Mandate
ORBilu team
Impact and visibility
About statistics
About metrics
OAI-PMH
Project history
Legal Information
Data protection
Legal notices
Back
Home
Detailed Reference
Download
Doctoral thesis (Dissertations and theses)
On the hardness of the hidden subset sum problem: algebraic and statistical attacks
GINI, Agnese
2022
Permalink
https://hdl.handle.net/10993/51778
Files (1)
Send to
Details
Statistics
Bibliography
Similar publications
Files
Full Text
Gini_PhD.pdf
Author postprint (1.26 MB)
Download
All documents in ORBilu are protected by a
user license
.
Send to
RIS
BibTex
APA
Chicago
Permalink
X
Linkedin
copy to clipboard
copied
Details
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 :
CORON, Jean-Sébastien
Available on ORBilu :
since 25 July 2022
Statistics
Number of views
225 (30 by Unilu)
Number of downloads
288 (14 by Unilu)
More statistics
Bibliography
Similar publications
Contact ORBilu