Baby-step giant-step algorithms for the symmetric group
From MaRDI portal
Publication:2409009
DOI10.1016/J.JSC.2017.07.003zbMATH Open1378.68199OpenAlexW2736271132MaRDI QIDQ2409009FDOQ2409009
Authors: Eric Bach, Bryce Sandlund 
Publication date: 10 October 2017
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2017.07.003
Recommendations
- Baby-step giant-step algorithms for the symmetric group
- Complexity of a determinate algorithm for the discrete logarithm
- scientific article; zbMATH DE number 6488034
- Square-root algorithms for the discrete logarithm problem (a survey)
- Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem
Symbolic computation and algebraic computation (68W30) Symmetric groups (20B30) Group actions on combinatorial structures (05E18)
Cites Work
- Practical graph isomorphism. II.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Monte Carlo Methods for Index Computation (mod p)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An optimal lower bound on the number of variables for graph identification
- ON THE PROBLEM OF JACOBSTHAL
- Title not available (Why is that?)
- Complexity of a determinate algorithm for the discrete logarithm
- Title not available (Why is that?)
- Graph isomorphism in quasipolynomial time (extended abstract)
- Square-root algorithms for the discrete logarithm problem (a survey)
- On the order of magnitude of Jacobsthal's function
- Computation schemes for splitting fields of polynomials
- A parallel approach in computing correlation immunity up to six variables
Cited In (1)
Uses Software
This page was built for publication: Baby-step giant-step algorithms for the symmetric group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409009)
