scientific article; zbMATH DE number 579167

MaRDI QIDQ4293690zbMATH OpenFDO

Authors P. Codecà, Luciano Biasini, Gaetano Zanghirati

Publication date 7 July 1994

zbMATH Keywords

algorithmsprimalityprobabilistic tests

Mathematics Subject Classification ID

Primality (11Y11) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Deterministic and probabilistic primality tests
• scientific article; zbMATH DE number 4039974
• A new probabilistic primality test
• Implementation of a new primality test
• scientific article; zbMATH DE number 4049704
• scientific article; zbMATH DE number 5845877
• scientific article; zbMATH DE number 1263352
• Information Security Practice and Experience
• Implementations of the improved AKS primality testing algorithm
• Primality testing with fewer random bits

Cited in

(14)

• A probable prime test with high confidence
• Verification of the Miller-Rabin probabilistic primality test.
• On the number of primality witnesses of composite integers
• A new probabilistic primality test
• Generating Provable Primes Efficiently on Embedded Devices
• scientific article; zbMATH DE number 5845877 (Why is no real title available?)
• Experimental results on probable primality
• A Performance Analysis of a Simple Prime-Testing Algorithm
• Some negative results concerning prime number generators
• scientific article; zbMATH DE number 4039974 (Why is no real title available?)
• scientific article; zbMATH DE number 4049704 (Why is no real title available?)
• A Fast Monte-Carlo Test for Primality
• Primality Test Via Quantum Factorization
• A low complexity probabilistic test for integer multiplication

This page was built for publication:

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