scientific article; zbMATH DE number 4103163

MaRDI QIDQ3828064zbMATH OpenFDO

Authors V. R. R. Uppuluri, Sreenivasa Rao Jammalamadaka

Publication date 1989

zbMATH Keywords

computational number theoryprobabilistic tests of primalitypublic-key cryptosystemsRSA algorithm

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Primes (11A41) Cryptography (94A60)

Recommendations

• Recent developments in primality testing
• Deterministic and probabilistic primality tests
• A new probabilistic primality test
• Primality testing in polynomial time. From randomized algorithms to ``PRIMES is in P.
• Prime-number algorithm for public-key systems

Cited in

(13)

• A probable prime test with very high confidence for \(n \equiv 3\mod4\)
• Prime-number algorithm for public-key systems
• A new probabilistic primality test
• Primes in quadratic unique factorization domains
• scientific article; zbMATH DE number 5594161 (Why is no real title available?)
• Deterministic and probabilistic primality tests
• Testing numbers for primality
• scientific article; zbMATH DE number 3957201 (Why is no real title available?)
• scientific article; zbMATH DE number 4006326 (Why is no real title available?)
• scientific article; zbMATH DE number 1504550 (Why is no real title available?)
• scientific article; zbMATH DE number 953285 (Why is no real title available?)
• It is easy to determine whether a given integer is prime
• scientific article; zbMATH DE number 5590087 (Why is no real title available?)

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 Q3828064)