Algorithms for Sparse Random 3XOR: The Low-Density Case

Autor: Bouillaguet, Charles, Delaplace, Claire, Joux, Antoine

We present algorithms for variants of the 3XOR problem with lists consisting of random sparse $n$-bit vectors. We consider two notions of sparsity: low-density (each bit is independently biased towards zero) and low-weight (the Hamming weight of $n$-

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::38e4dd7ef88c4f56fc0d877ba067d691
https://hal.archives-ouvertes.fr/hal-02306917

Algorithms for the Sparse Random 3XOR Problem

Autor: Bouillaguet, Charles, Delaplace, Claire

We present two new algorithms for a variant of the 3XOR problem with lists consisting of N n-bit 10 vectors whose coefficients are drawn randomly according to a Bernoulli distribution of parameter 11 p < 1/2. We show that in this particular context t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8a6fa3f50378891b0cd2974341767165
https://hal.archives-ouvertes.fr/hal-02306917

Quantum Algorithms for the $$k$$-xor Problem

Autor: Lorenzo Grassi, María Naya-Plasencia, André Schrottenloher

Publikováno v: Advances in Cryptology – ASIACRYPT 2018-24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2–6, 2018, Proceedings, Part I
ASIACRYPT 2018-24th Annual International Conference on the Theory and Application of Cryptology and Information Security
ASIACRYPT 2018-24th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2018, Brisbane, Australia. pp.527-559, ⟨10.1007/978-3-030-03326-2_18⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – ASIACRYPT 2018
Lecture Notes in Computer Science ISBN: 9783030033255
ASIACRYPT (1)

International audience; The k-xor (or generalized birthday) problem is a widely studied question with many applications in cryptography. It aims at finding k elements of n bits, drawn at random, such that the xor of all of them is 0. The algorithms p

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0204d0dbd2a9db57beaa24df3d2a82ff

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.