Search Results - "Dinur, Itai"

Cryptanalytic Time–Memory–Data Trade-offs for FX-Constructions and the Affine Equivalence Problem by Dinur, Itai

“…The FX-construction was proposed in 1996 by Kilian and Rogaway as a generalization of the DESX scheme. The construction increases the security of an n -bit…”
Get full text

An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing by Dinur, Itai, Keller, Nathan, Klein, Ohad

“…The distributed discrete logarithm (DDL) problem was introduced by Boyle, Gilboa and Ishai at CRYPTO 2016. A protocol solving this problem was the main tool…”
Get full text

Preface to Volume 2022, Issue 1 by Dinur, Itai, Mennink, Bart

Get full text

Generic Attacks on Hash Combiners by Bao, Zhenzhen, Dinur, Itai, Guo, Jian, Leurent, Gaëtan, Wang, Lei

“…Hash combiners are a practical way to make cryptographic hash functions more tolerant to future attacks and compatible with existing infrastructure. A combiner…”
Get full text

Efficient Dissection of Bicomposite Problems with Cryptanalytic Applications by Dinur, Itai, Dunkelman, Orr, Keller, Nathan, Shamir, Adi

“…In this paper, we show that a large class of diverse problems have a bicomposite structure which makes it possible to solve them with a new type of algorithm…”
Get full text

Key Recovery Attacks on Iterated Even–Mansour Encryption Schemes by Dinur, Itai, Dunkelman, Orr, Keller, Nathan, Shamir, Adi

“…Iterated Even–Mansour (EM) encryption schemes (also named “key-alternating ciphers”) were extensively studied in recent years as an abstraction of commonly…”
Get full text

Preface to Volume 2021, Issue 1 by Dinur, Itai, Leurent, Gaëtan

Get full text

Preface to Volume 2020, Special Issue on Designs for the NIST Lightweight Standardisation Process by Itai Dinur, Gaëtan Leurent

Get full text

Improved Practical Attacks on Round-Reduced Keccak by Dinur, Itai, Dunkelman, Orr, Shamir, Adi

“…The Keccak hash function is the winner of NIST’s SHA-3 competition, and so far it showed remarkable resistance against practical collision finding attacks:…”
Get full text

An algorithmic framework for the generalized birthday problem by Dinur, Itai

“…The generalized birthday problem (GBP) was introduced by Wagner in 2002 and has shown to have many applications in cryptanalysis. In its typical variant, we…”
Get full text

Preface to Volume 2020, Special Issue on Designs for the NIST Lightweight Standardisation Process by Dinur, Itai, Leurent, Gaëtan

Get full text

Fine-Grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR by Dinur, Itai, Keller, Nathan, Klein, Ohad

“…An average-case variant of the k -SUM conjecture asserts that finding k numbers that sum to 0 in a list of r random numbers, each of the order r^{k} , cannot…”
Get full text

Improved Generic Attacks Against Hash-Based MACs and HAIFA by Dinur, Itai, Leurent, Gaëtan

“…The security of HMAC (and more general hash-based MACs) against state-recovery and universal forgery attacks was shown to be suboptimal, following a series of…”
Get full text

Applying cube attacks to stream ciphers in realistic scenarios by Dinur, Itai, Shamir, Adi

“…Cube attacks were introduced in Dinur and Shamir ( 2009 ) as a cryptanalytic technique that requires only black box access to the underlying cryptosystem. The…”
Get full text

Reflections on slide with a twist attacks by Dinur, Itai, Dunkelman, Orr, Keller, Nathan, Shamir, Adi

“…Slide attacks use pairs of encryption operations which are slid against each other. Slide with a twist attacks are more sophisticated variants of slide attacks…”
Get full text

Improved Algorithms for Solving Polynomial Systems over GF(2) by Multiple Parity-Counting by Dinur, Itai

“…We consider the problem of finding a solution to a multivariate polynomial equation system of degree $d$ in $n$ variables over $\mathbb{F}_2$. For $d=2$, the…”
Get full text

New Methods in Cryptanalysis of Secret Key Algorithms by Dinur, Itai

“…Secret key cryptographic primitives (block ciphers, stream ciphers, MACs and hash functions) play a crucial role in secure communication. For example, block…”
Get full text

Fine-Grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR by Dinur, Itai, Keller, Nathan, Klein, Ohad

“…An average-case variant of the $k$-SUM conjecture asserts that finding $k$ numbers that sum to 0 in a list of $r$ random numbers, each of the order $r^k$,…”
Get full text

On Differential Privacy and Adaptive Data Analysis with Bounded Space by Dinur, Itai, Stemmer, Uri, Woodruff, David P, Zhou, Samson

“…We study the space complexity of the two related fields of differential privacy and adaptive data analysis. Specifically, (1) Under standard cryptographic…”
Get full text

IACR Transactions on Symmetric Cryptology: Volume 2021, Issue 1 by Leurent, Gaëtan, Dinur, Itai

Get full text