Polylog depth circuits for integer factoring and discrete logarithms

DOI10.1006/INCO.1994.1021zbMath0802.11058OpenAlexW2039900398MaRDI QIDQ1322462

Jonathan P. Sorenson

Publication date: 4 September 1994

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/59174

zbMATH Keywords

finite fieldfactorizationparallel processingdiscrete logarithmsprobabilistic circuitspolylog depth

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Distributed algorithms (68W15) Factorization (11Y05)

This page was built for publication: Polylog depth circuits for integer factoring and discrete logarithms