On iterative collision search for LPN and subset sum

DOI10.1007/978-3-319-70503-3_24zbMath1416.68143OpenAlexW2766730477MaRDI QIDQ1690294

Srinivas Devadas, Hanshen Xiao, Ling Ren

Publication date: 19 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70503-3_24

zbMATH Keywords

combinatorial algorithmssubset sumiterative collision searchLearning Parity with Noise (LPN)

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

A non-heuristic approach to time-space tradeoffs and optimizations for BKW

This page was built for publication: On iterative collision search for LPN and subset sum