Results 31 to 40 of about 37,491 (303)
On primality of Cartesian product of graphs [PDF]
Arab Journal of Mathematical SciencesPurposeThe present work focuses on the primality and the Cartesian product of graphs.Design/methodology/approachGiven a graph G, a subset M of V (G) is a module of G if, for a, b ∈ M and x ∈ V (G) \ M, xa ∈ E(G) if and only if xb ∈ E(G).
Nadia El Amri +2 more
doaj +1 more source
An RSA Scheme based on Improved AKS Primality Testing Algorithm
MATEC Web of Conferences, 2016 In applied cryptography, RSA is a typical asymmetric algorithm, which is used in electronic transaction and many other security scenarios. RSA needs to generate large random primes.
Wu Han Wei +4 more
doaj +1 more source
How Do You Measure Primality? [PDF]
The American mathematical monthly, 2014 In commutative monoids, the ω-value measures how far an element is from being prime. This invariant, which is important in understanding the factorization theory of monoids, has been the focus of much recent study.
C. O’Neill, Roberto Pelayo
semanticscholar +1 more source
A framework for deterministic primality proving using elliptic curves with complex multiplication [PDF]
Mathematics of Computation, 2014 We provide a framework for using elliptic curves with complex multiplication to determine the primality or compositeness of integers that lie in special sequences, in deterministic quasi-quadratic time.
Alexander Abatzoglou +3 more
semanticscholar +1 more source
ON A NEW CLASS OF SMARANDACHE PRIME NUMBERS [PDF]
, 2005 The purpose of this note is to report on the discovery of some new prime numbers that were built from factorials, the Smarandache Consecutive Sequence, and the Smarandache Reverse ...
Earls, Jason
core +1 more source
Characterization of prime and composite numbers using the notion of successive sum of integers and the consequence in primality testing [PDF]
Notes on Number Theory and Discrete MathematicsIn this paper, we give a characterization of primes and composite natural numbers using the notion of the sum of successive natural numbers. We prove essentially that an odd natural number N≥3 is prime if and only if the unique decomposition of N as a ...
Fateh Mustapha Dehmeche +2 more
doaj +1 more source
Primality proving with Gauss and Jacobi sums
Journal of Telecommunications and Information Technology, 2004 This article presents a primality test known as APR (Adleman, Pomerance and Rumely) which was invented in 1980. It was later simplified and improved by Cohen and Lenstra.
Andrzej Chmielowiec
doaj +1 more source
Annals of Pure and Applied Logic, 1990 This the first of a series of articles dealing with abstract classification theory. The apparatus to assign systems of cardinal invariants to models of a first order theory (or determine its impossibility) is developed in [Sh:a]. It is natural to try to extend this theory to classes of models which are described in other ways.
John T. Baldwin 0001, Saharon Shelah
openaire +2 more sources
A faster pseudo-primality test [PDF]
Rendiconti del circolo matematico di Palermo, 2012 We propose a pseudo-primality test using cyclic extensions of ℤ/nℤ. For every positive integer k⩽logn, this test achieves the security of k Miller-Rabin tests at the cost of k1/2+o(1) Miller-Rabin tests.
J. Couveignes, Tony Ezome
semanticscholar +1 more source
Lower bounds on the orders of subgroups connected with Agrawal conjecture
Karpatsʹkì Matematičnì Publìkacìï, 2013 Explicit lower bounds are obtained on the multiplicative orders of subgroups of a finite field connected with primality proving algorithm.
R. Popovych
doaj +1 more source