Results 61 to 70 of about 200 (167)
On integer sequences in cryptography
Integer sequences play a pivotal role in cryptography, acting as foundational elements for numerous cryptographic algorithms. This comprehensive investigation examines integer sequences that have significantly impacted the sector in domains such as key ...
Raso Mario, Venturi Daniele
doaj +1 more source
Proof of exponentiation: enhanced prover efficiency for algebraic statements
Recent years have seen the widespread adoption of zkSNARKs constructed over small fields, including but not limited to, the Goldilocks field, small Mersenne prime fields, and tower of binary fields.
Zhuo Wu +5 more
doaj +1 more source
Sieve for Mersenne prime numbers
The algorithm generates many odd numbers, but only prime numbers of mersenne and not common prime numbers.
openaire +1 more source
On prime factors of Mersenne numbers
to appear in Palestine Journal of ...
Cambraia, Ady jun. +4 more
openaire +3 more sources
Strongly Base-Two Groups. [PDF]
Burness TC, Guralnick RM.
europepmc +1 more source
Learned pseudo-random number generator: WGAN-GP for generating statistically robust random numbers. [PDF]
Okada K +3 more
europepmc +1 more source
Artin reciprocity and Mersenne primes
From its conception in the work of Kronecker and Hilbert until Takagi's great paper of 1920, class field theory was developed in order to prove reciprocity laws. When Artin succeeded in proving his reciprocity law in 1927, however, its role changed dramatically, and soon afterwards it became a cornerstone of class field theory.
Lenstra, H.W., Stevenhagen, P.
openaire +3 more sources
Improving the efficiency of using multivalued logic tools: application of algebraic rings. [PDF]
Suleimenov IE +3 more
europepmc +1 more source
Overpseudoprimes, Mersenne Numbers and Wieferich primes
Adding of the second proof of Theorem ...
openaire +2 more sources

