Algorithmic Number Theory

DOI10.1007/11792086zbMath1143.94351arXivmath/0603727OpenAlexW2977481208WikidataQ29400612 ScholiaQ29400612MaRDI QIDQ5899276

Ramarathnam Venkatesan, Stephen D. Miller

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

spectral analysisrandom walkcollision timemixing timediscrete logarithmexpander graphPollard Rho algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Isolated elliptic curves and the MOV attack ⋮ Rigorous analysis of a randomised number field sieve ⋮ A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm

This page was built for publication: Algorithmic Number Theory