Results 61 to 70 of about 463 (134)
Improvements to Lucas-sequence modular square roots and primality testing [PDF]
Lucas sequences are a helpful tool in mathematical and cryptographic calculations, providing in particular an efficient way to exponentiate in a quotient ring $R[x]/(x^2 - Px + Q)$. As with exponentiation in other finite rings and fields, we can use the
Mike Hamburg
core
PRIMALITY TESTING TECHNIQUES AND THE IMPORTANCE OF PRIME NUMBERS IN SECURITY PROTOCOLS
, 2008 - This study presents primality testing by mostly emphasizing on probabilistic primality tests. It is proposed an algorithm for the generation and testing of primes, and explained Carmichael numbers.
core
Efficient manipulation and generation of Kirchhoff polynomials for the analysis of non-equilibrium biochemical reaction networks. [PDF]
J R Soc Interface, 2020 Yordanov P, Stelling J.
europepmc +1 more source
A Verified Implementation of Algebraic Numbers in Isabelle/HOL. [PDF]
J Autom Reason, 2020 Joosten SJC, Thiemann R, Yamada A.
europepmc +1 more source
Entropy, Periodicity and the Probability of Primality. [PDF]
Entropy (Basel)Croll GJ.
europepmc +1 more source
Too good to be true: when overwhelming evidence fails to convince. [PDF]
Proc Math Phys Eng Sci, 2016 Gunn LJ +5 more
europepmc +1 more source
Privacy and security enhancement in smart cities using advanced cryptographic techniques. [PDF]
Sci RepMore KD, Pramod D.
europepmc +1 more source
Computational challenges and solutions: Prime number generation for enhanced data security. [PDF]
PLoS OneEzz-Eldien A +6 more
europepmc +1 more source
Primality Testing with Fewer Random Bits
, 2007 In the usual formulations of the Miller-Rabin and Solovay-Strassen primality testing algorithms, to test a number n for primality, the algorithm chooses "candidates" x 1 ; x 2 ; : : : ; x k uniformly and independently at random from Z n , and ...
Victor Shoup, René Peralta
core