Results 21 to 30 of about 463 (134)
Random Primes without Primality Testing
Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation, 2022 Numerous algorithms call for computation over the integers modulo a randomly-chosen large prime. In some cases, the quasi-cubic complexity of selecting a random prime can dominate the total running time. We propose a new variant of the classic D5 algorithm for "dynamic evaluation", applied to a randomly-chosen (composite) integer.
Pascal Giorgi +3 more
openaire +2 more sources
An Analysis of Primality Testing and Its Use in Cryptographic Applications [PDF]
, 2020 Due to their fundamental utility within cryptography, prime numbers must be easy to both recognise and generate. For this, we depend upon primality testing.
Massimo, Jake
core +1 more source
, 2017 In this thesis, I review the problem of primality testing. More specifically, I review the AKS algorithm and the theorems and problems leading up to the proof of this ...
Siracusa, Mia
core +1 more source
, 2022 Tema ovog rada bit će testovi prostosti. Testove prostosti dijelimo na determinističke i vjerojatnosne. Sukladno tome, rad je podijeljen na dva dijela.
Moguš, Magdalena
core
Lucas Sequences in Primality Testing
, 2014 Prime or composite? This classification determines whether or not integers can be used in digital security. One such way to begin testing an integers primality is with the Fermat test, which says that if n is a prime number and a is an integer then an-1 ≡
Karl Heimbuck (10081618)
core +1 more source
Cyclemaster Matrices and Primality Testing
, 2023 We define the $N \times N$ single variable cyclemaster matrix, and use its determinant to construct a necessary and sufficient test for $N$ to be prime.
Mazur, Marcin, Zemyan, Stephen M.
openaire +3 more sources
Geometric primality tests using genus 1 & 2 curves [PDF]
, 2017 We revisit and generalize some geometric techniques behind deterministic primality testing for some integer sequences using curves of genus 1 over finite rings. Subsequently we develop a similar primality test using the Jacobian of a genus 2 curve.
Ruíz Duarte, Eduardo
core +2 more sources
Sir Syed University Research Journal of Engineering and Technology, 2018 A new structure to develop 64-bit RSA encryption engine on FPGA is being presented in this paper that can be used as a standard device in the secured communication system. The RSA algorithm has three parts i.e. key generation, encryption and decryption.
Rehan Shams +3 more
doaj
Novel methods for primality testing and factoring
, 2005 From the time of the Greeks, primality testing and factoring have fascinated mathematicians, and for centuries following the Greeks primality testing and factorization were pursued by enthusiasts and professional mathematicians for their intrisic ...
Hammad, Yousef Bani
core