Skip to search formSkip to main contentSkip to account menu

Miller–Rabin primality test

Known as: Miller-Rabin primality test, Miller rabin, Miller-Rabin algorithm 
The Miller–Rabin primality test or Rabin–Miller primality test is a primality test: an algorithm which determines whether a given number is prime… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Entanglement, describing the inseparability of a quantum multiparty system, is one of the most intriguing features of quantum… 
2015
2015
In this paper, a two-stage broadband CMOS stacked FET RF power amplifier (PA) with a reconfigurable interstage matching network… 
2011
2011
This paper presents three primality tests; Fermat test, Solovay-Strassen test, and Rabin-Miller test. Mathematica software is… 
2008
2008
The enantiospecific adsorption and desorption of (R)-3-methylcyclohexanone on naturally chiral Cu(531)R&S surfaces was studied… 
2007
2007
Essentially all work studying the round complexity of secure computation assume broadcast as an atomic primitive. Protocols… 
2006
2006
A 2–5V 150 mA CMOS low dropout (LDO) linear regulator with a single Miller capacitor of 4pF is presented. The proposed LDO… 
2005
2005
Most prior designated confirmer signature schemes either prove security in the random oracle model (ROM) or use general zero… 
1999
1999
In four experiments using rat subjects, we investigated the effects of presenting a novel flavor cue at the time of pairing an… 
Highly Cited
1987
Highly Cited
1987
Neocalanus tonsus Brady was collected in subantarctic waters off southeastern New Zealand to test experimentally the importance…