EPFL

Algo+LMA

This shows you the differences between two versions of the page.

— |
en:group:seminars:tmp:20090311 [2016/06/23 11:26] (current) |
||
---|---|---|---|

Line 1: | Line 1: | ||

+ | |||

+ | ---- dataentry seminar ---- | ||

+ | date_dt : 2009.03.11 | ||

+ | title : The subset sum pseudorandom generator | ||

+ | speaker : Prof. Joachim von zur Gathen | ||

+ | affiliation : Bonn-Aachen International Center for Information Technology. | ||

+ | time : 16h15-17h15 | ||

+ | room : BC129 | ||

+ | table : seminars | ||

+ | =================== | ||

+ | template:datatemplates:seminar | ||

+ | ----------------------- | ||

+ | |||

+ | |||

+ | ==== abstract ==== | ||

+ | I present several results concerning a pseudorandom generator introduced by Rueppel and Massey in 1985. It is a streamed version of the NP-complete subset sum problem, where the stream is given by a linearly recurrent sequence. I start with several attacks on this generator, some of which are rigorously proven while others are heuristic. They work when one "half" of the secret is given, either the linearly recurrent stream or the summands in the problem. In a typical setting, this reduces the security from the previously assumed n^2 bit to n bits. It is conjectured that the generator is secure at this level. \\ Next come improved implementations of the generator. Some special choices of the secret parameters speed up the naive usage of this generator without losing the property of uniform distribution. These results confirm that the generator can be useful for both cryptographic and Quasi Monte Carlo applications. | ||