Comparison of the efficiency of the factoring algorithms of Morrison-Brillhart and Schroeppel

DOI10.1007/BF02280781zbMath0501.10008OpenAlexW1422496109MaRDI QIDQ1172079

Jürgen Sattler, Claus Peter Schnorr

Publication date: 1983

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02280781

zbMATH Keywords

factorization of integerscomparison of integer factoring algorithms of Morrison-Brillhart and Schroeppel

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Cites Work

• Unnamed Item
• Analysis of a simple factorization algorithm
• Refined analysis and improvements on some factoring algorithms
• A Method of Factoring and the Factorization of F 7
• A method for obtaining digital signatures and public-key cryptosystems
• On factoring large numbers

This page was built for publication: Comparison of the efficiency of the factoring algorithms of Morrison-Brillhart and Schroeppel