Baby-step giant-step algorithms for the symmetric group
From MaRDI portal
Publication:2409009
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
Cites work
- scientific article; zbMATH DE number 4214161 (Why is no real title available?)
- scientific article; zbMATH DE number 3176961 (Why is no real title available?)
- scientific article; zbMATH DE number 1231230 (Why is no real title available?)
- scientific article; zbMATH DE number 475356 (Why is no real title available?)
- scientific article; zbMATH DE number 2133330 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- scientific article; zbMATH DE number 3353398 (Why is no real title available?)
- A parallel approach in computing correlation immunity up to six variables
- An optimal lower bound on the number of variables for graph identification
- Complexity of a determinate algorithm for the discrete logarithm
- Computation schemes for splitting fields of polynomials
- Graph isomorphism in quasipolynomial time (extended abstract)
- Monte Carlo Methods for Index Computation (mod p)
- ON THE PROBLEM OF JACOBSTHAL
- On the order of magnitude of Jacobsthal's function
- Practical graph isomorphism. II.
- Square-root algorithms for the discrete logarithm problem (a survey)
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)