License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2023.23
URN: urn:nbn:de:0030-drops-185579
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/18557/
Bouillaguet, Charles ;
Martinez, Florette ;
Vergnaud, Damien
Cryptanalysis of a Generalized Subset-Sum Pseudorandom Generator
Abstract
We present attacks on a generalized subset-sum pseudorandom generator, which was proposed by von zur Gathen and Shparlinski in 2004. Our attacks rely on a sub-quadratic algorithm for solving a vectorial variant of the 3SUM problem, which is of independent interest. The attacks presented have complexities well below the brute-force attack, making the generators vulnerable. We provide a thorough analysis of the attacks and their complexities and demonstrate their practicality through implementations and experiments.
BibTeX - Entry
@InProceedings{bouillaguet_et_al:LIPIcs.MFCS.2023.23,
author = {Bouillaguet, Charles and Martinez, Florette and Vergnaud, Damien},
title = {{Cryptanalysis of a Generalized Subset-Sum Pseudorandom Generator}},
booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)},
pages = {23:1--23:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-292-1},
ISSN = {1868-8969},
year = {2023},
volume = {272},
editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18557},
URN = {urn:nbn:de:0030-drops-185579},
doi = {10.4230/LIPIcs.MFCS.2023.23},
annote = {Keywords: Cryptography, pseudo-random generator, subset-sum problem, 3SUM problem, cryptanalysis}
}
