Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Schrottenloher, André"'
The Dihedral Coset Problem (DCP) in $Z_N$ has been extensively studied in quantum computing and post-quantum cryptography, as for instance, the Learning with Errors problem reduces to it. While the Ettinger-Hoyer algorithm is known to solve the DCP i
Externí odkaz:
http://arxiv.org/abs/2206.14408
Given a random function $f$ with domain $[2^n]$ and codomain $[2^m]$, with $m \geq n$, a collision of $f$ is a pair of distinct inputs with the same image. Collision finding is an ubiquitous problem in cryptanalysis, and it has been well studied usin
Externí odkaz:
http://arxiv.org/abs/2205.14023
In this paper, we report the first quantum key-recovery attack on a symmetric block cipher design, using classical queries only, with a more than quadratic time speedup compared to the best classical attack. We study the 2XOR-Cascade construction of
Externí odkaz:
http://arxiv.org/abs/2110.02836
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 23 no. 2, special issue in honour of Maurice Pouzet, Special issues (May 6, 2022) dmtcs:7435
The finite models of a universal sentence $\Phi$ in a finite relational signature are the age of a structure if and only if $\Phi$ has the joint embedding property. We prove that the computational problem whether a given universal sentence $\Phi$ has
Externí odkaz:
http://arxiv.org/abs/2104.11123
Autor:
Bonnetain, Xavier, Hosoyamada, Akinori, Naya-Plasencia, María, Sasaki, Yu, Schrottenloher, André
In symmetric cryptanalysis, the model of superposition queries has led to surprising results, with many constructions being broken in polynomial time thanks to Simon's period-finding algorithm. But the practical implications of these attacks remain b
Externí odkaz:
http://arxiv.org/abs/2002.12439
We present new classical and quantum algorithms for solving random subset-sum instances. First, we improve over the Becker-Coron-Joux algorithm (EUROCRYPT 2011) from $\tilde{\mathcal{O}}(2^{0.291 n})$ downto $\tilde{\mathcal{O}}(2^{0.283 n})$, using
Externí odkaz:
http://arxiv.org/abs/2002.05276
Autor:
Biasse Jean-François, Bonnetain Xavier, Pring Benjamin, Schrottenloher André, Youmans William
Publikováno v:
Journal of Mathematical Cryptology, Vol 15, Iss 1, Pp 4-17 (2020)
We propose a heuristic algorithm to solve the underlying hard problem of the CSIDH cryptosystem (and other isogeny-based cryptosystems using elliptic curves with endomorphism ring isomorphic to an imaginary quadratic order 𝒪). Let Δ = Disc(𝒪)
Externí odkaz:
https://doaj.org/article/3f4a6b592a034dc7aa26d51735aee5df
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Designs, Codes & Cryptography; Mar2024, Vol. 92 Issue 3, p723-751, 29p
Publikováno v:
Advances in Cryptology – EUROCRYPT 2020
The k-xor or Generalized Birthday Problem aims at finding, given k lists of bit-strings, a k-tuple among them XORing to 0. If the lists are unbounded, the best classical (exponential) time complexity has withstood since Wagner’s CRYPTO 2002 paper.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmc_________::00dd8da4e07ad673b52f1b4b63153d31
http://europepmc.org/articles/PMC7991677
http://europepmc.org/articles/PMC7991677