Factorization and Primality Tests

DOI10.2307/2322136zbMATH Open0548.10003OpenAlexW4245904671MaRDI QIDQ3340912FDOQ3340912

Authors: John D. Dixon 

Publication date: 1984

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2322136

Recommendations

• scientific article; zbMATH DE number 44444
• scientific article
• scientific article
• scientific article; zbMATH DE number 2066372
• scientific article; zbMATH DE number 6308078
• Primality tests
• Primality tests
• Primality tests and factorization algorithms. I

zbMATH Keywords

surveybibliographycomputational number theoryprimality testingfactoring algorithmfactoring methodsgroup of points of finite elliptic curves

Mathematics Subject Classification ID

Elliptic curves over global fields (11G05) Factorization (11Y05) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Factorization; primality (11A51) Primality (11Y11)

Cited In (17)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Factoring: algorithms, computations, and computers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sequences of numbers generated by addition in formal groups and new primality and factorization tests
• Primality tests and factorization algorithms. I
• Factoring with Cyclotomic Polynomials
• Primality testing
• Title not available (Why is that?)
• Prime-number algorithm for public-key systems
• Rabin-Miller Primality Test: Composite Numbers Which Pass It
• An overview of factoring
• Computing in general Abelian groups is hard
• Integer factorization and twin primes verification algorithms

This page was built for publication: Factorization and Primality Tests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340912)