BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:654@lincs.fr
DTSTART;TZID=Europe/Paris:20210630T110000
DTEND;TZID=Europe/Paris:20210630T120000
DTSTAMP:20210915T121712Z
URL:https://www.lincs.fr/events/algorithms-for-generating-random-permutati
 ons/
SUMMARY:Algorithms for generating random permutations
DESCRIPTION:Systems such as masscan\, yarrp and diamond-miner send in the
 order of a million packets/s in order to discover open ports and packet
 paths on the Internet. To avoid overloading the network and trigger
 rate-limiting or intrusion detection systems\, the probes must be
 distributed evenly across the network. Standard methods for generating
 random permutations\, such as the Fisher-Yates shuffle\, usually require to
 store the whole permutation in memory\, which is prohibitive when the
 number of probes to send is large (>1B typically). In this talk we will
 discuss methods to generate random permutations\, and in particular the
 Generalized-Feistel Cipher [1] which can generate permutations on arbitrary
 domains\, on-the-fly and in constant memory.\n\n[1] Black\, John\, and
 Phillip Rogaway. “Ciphers with arbitrary finite domains.”
 /Cryptographers’ track at the RSA conference/. Springer\, Berlin\,
 Heidelberg\, 2002.\n\n
CATEGORIES:Network Theory,Working Group,Youtube
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20210328T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR