17 citations · 54 across the 24 of their papers we have counts for
Showing cs.CRShow all
3 papers · 1 filter
cs.CR2021
Fine-Grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR
Itai Dinur, Nathan Keller, Ohad Klein
An average-case variant of the -SUM conjecture asserts that finding numbers that sum to 0 in a list of random numbers, each of the order , cannot be done in much le…
cs.CR2017
Tight Bounds on Online Checkpointing Algorithms
Achiya Bar-On, Itai Dinur, Orr Dunkelman +4
The problem of online checkpointing is a classical problem with numerous applications which had been studied in various forms for almost 50 years. In the simplest version of this p…
cs.CR2006
MV3: A new word based stream cipher using rapid mixing and revolving buffers
Nathan Keller, Stephen D. Miller, Ilya Mironov +1
MV3 is a new word based stream cipher for encrypting long streams of data. A direct adaptation of a byte based cipher such as RC4 into a 32- or 64-bit word version will obviously n…