scientific article; zbMATH DE number 4103163

zbMATH Open0674.10004MaRDI QIDQ3828064FDOQ3828064

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

Publication date: 1989

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

public-key cryptosystemscomputational number theoryRSA algorithmprobabilistic tests of primality

Mathematics Subject Classification ID

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

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• It is easy to determine whether a given integer is prime
• A probable prime test with very high confidence for \(n \equiv 3\mod4\)
• Title not available (Why is that?)
• Deterministic and probabilistic primality tests
• Title not available (Why is that?)
• Primes in quadratic unique factorization domains
• Title not available (Why is that?)
• Testing numbers for primality

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)