Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Primality test

Known as: Detecting primes, Compositeness test, Isprime 
A primality test is an algorithm for determining whether an input number is prime. Amongst other fields of mathematics, it is used for cryptography… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Cryptanalysis I.- Practical Cryptanalysis of SFLASH.- Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5.- Secure Searching… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Stream Ciphers.- Algebraic Attacks on Clock-Controlled Stream Ciphers.- Cache Based Power Analysis Attacks on AES… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper considers the problem of determining the achievable rates in multi-hop wireless networks. We consider the problem of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1997
Highly Cited
1997
The problem of calculating the trace of an elliptic curve over a finite field has attracted considerable interest in recent years… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Many number-theoretic algorithms rely on a result of Ankeny, which states that if the Extended Riemann Hypothesis (ERH) is true… Expand
  • table 2
  • table 3
Is this relevant?
Highly Cited
1989
Highly Cited
1989
This is a discussion of number theory, covering factorization and primality testing. It is part of a series of undergraduate… Expand
Is this relevant?
Highly Cited
1980
Highly Cited
1980
Suppose we are given a set of generators for a group G of permutations of a colored set A. The color automorphism problem for G… Expand
Is this relevant?
Highly Cited
1974
Highly Cited
1974
1. Introduction . This paper is concerned with the problem of obtaining theoretical estimates for the number of arithmetical… Expand
Is this relevant?