Results 31 to 40 of about 463 (134)
, 1992 This tutorial describes the Miller-Rabin method for testing the primality of large integers. The method is illustrated by a Pascal algorithm.
Hansen, Per Brinch
core
Primality and identity testing via Chinese remaindering
, 1999 Gives a simple and new primality testing algorithm by reducing primality testing for a number n to testing if a specific univariate identity over Zn holds.
Biswas, S., Agrawal, M.
core +1 more source
, 2021 this text is in portuguese just so an important security leak within its practical use is kept under the nationality of the author first, it will later be translated in to ...
openaire +1 more source
Primality testing using elliptic curves
, 2010 In the present work we study primality tests. A primality test is an algorithm for determining whether an input number is prime. In the first part of this work we recapitulate the basic definitions and facts about number theory and study Pocklington's ...
Pashchenko, Olha
core +1 more source
Probabilistic algorithms for testing primality
, 2013 Attention has been paid mostly to the new deterministic algorithm for primality testing AKS recently. However, probabilistic algorithms remain an efficient tool for primality testing.
Tejkalová, Natálie
core
Dickson Pseudoprimes and Primality Testing [PDF]
, 2007 The paper gives a general definition for the concept of strong Dickson pseudoprimes which contains as special cases the Carmichael numbers and the strong Fibonacci pseudoprimes. Furthermore, we give necessary and sufficient conditions for two important classes of strong Dickson pseudoprimes and deduce some properties for their elements. A suggestion of
Winfried B. Müller, Alan Oswald
openaire +1 more source
, 2016 Im August 2002 veröffentlichten Manindra Agrawal, Neeraj Kayal und Nitin Saxena, alle drei Informatiker und Mathematiker am "Indian Institute of Technology Kanpur", den ersten deterministischen Primzahltest mit polynomialer Laufzeit.
Damrau, Milena
core
Autistic Savants and large number primality detection.
, 2020 In a sequel to the paper on small number primality detection by mental arithmetic. In this paper, we consider primality detection of four digit prime numbers, leading next to larger six digit and eight digit numbers, optionally scaled to arbitrary sized ...
Dr Bheemaiah. Anil K (Anil Kumar B)
core +1 more source
Implementations of the Improved AKS Primality Testing Algorithm
工程科学与技术, 2009 :The AKS algorithm successfully solved the noted problem of deterministic primality testing in polynomial time, but it was not yet suitable for the real application, thus it was improved in series.
doaj
Primality deterministic and primality probabilistic tests
Statistica, 2007 In this paper the A. comments the importance of prime numbers in mathematics and in cryptography. He remembers the very important researches of Eulero, Fermat, Legen-re, Rieman and others scholarships. There are many expressions that give prime numbers. Between them Mersenne’s primes have interesting properties.
openaire +2 more sources