Skip to search formSkip to main contentSkip to account menu

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… 
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… 
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… 
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… 
Highly Cited
2000
Highly Cited
2000
In this paper, the selection of test nodes has been studied extensively and efficient techniques are proposed. Two broad… 
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… 
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… 
Highly Cited
1980
Highly Cited
1980
  • J. Saxe
  • SIAM J. Algebraic Discret. Methods
  • 1980
  • Corpus ID: 3169927
In this paper we investigate the problem of testing the bandwidth of a graph: Given a graph, G, can the vertices of G be mapped… 
Highly Cited
1974
Highly Cited
1974
1. Introduction . This paper is concerned with the problem of obtaining theoretical estimates for the number of arithmetical…