Results 21 to 30 of about 263 (225)
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
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
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
METHOD OF TESTING LARGE NUMBERS FOR PRIMALITY
Сучасні інформаційні системиThe current stage of scientific and technological development entails ensuring information security across all domains of human activity. Confidential data and wireless channels of remote control systems are particularly sensitive to various types of ...
Vladimir Pevnev +3 more
doaj +1 more source
A Simple Algorithm for Prime Factorization and Primality Testing
Journal of Mathematics, 2022 We propose a new simple and faster algorithm to factor numbers based on the nature of the prime numbers contained in such composite numbers. It is well known that every composite number has a unique representation as a product of prime numbers.
Kabenge Hamiss
doaj +1 more source
Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317), 2001 The main result of the paper is that primality testing, gcd computation and square-free computation is not in \(AC^0\), that is, can not be accomplished by constant depth, polynomial-size circuits of AND, OR and NOT gates. The technique used by the authors is to reduce the functions that have circuit lower bound known to divisibility and then, using a ...
Eric Allender +2 more
openaire +3 more sources
Inverse problems with poisson noise: Primal and primal-dual splitting [PDF]
2011 18th IEEE International Conference on Image Processing, 2011 In this paper, we propose two algorithms for solving linear inverse problems when the observations are corrupted by Poisson noise. A proper data fidelity term (log-likelihood) is introduced to reflect the Poisson statistics of the noise. On the other hand, as a prior, the images to restore are assumed to be positive and sparsely represented in a ...
Dupé, François-Xavier +2 more
openaire +3 more sources