On improvements of ther-adding walk in a finite field of characteristic 2

DOI10.1080/09720529.2015.1084782zbMath1498.11239arXiv1601.04134OpenAlexW2963889764MaRDI QIDQ5069758

Ansari Abdullah, Hardik Gajera, Ayan Mahalanobis

Publication date: 19 April 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.04134

zbMATH Keywords

discrete logarithm problemgeneric algorithms\(r\)-adding walk

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

Recursive construction of normal polynomials over finite fields

Uses Software

• Magma
• R

Cites Work

• Unnamed Item
• Accelerating Pollard's rho algorithm on finite fields
• The Magma algebra system. I: The user language
• Complexity of a determinate algorithm for the discrete logarithm
• On random walks for Pollard's rho method
• Period Lengths for Iterated Functions
• A random graph
• Monte Carlo Methods for Index Computation (mod p)
• Probability Distributions Related to Random Mappings

This page was built for publication: On improvements of ther-adding walk in a finite field of characteristic 2