Results 91 to 100 of about 385 (161)
Automatic Generation of High-Performance Modular Multipliers for Arbitrary Mersenne Primes on FPGAs
, 2017 Modular multiplication is a fundamental and performance determining operation in various public-key cryptosystems. High-performance modular multipliers on FPGAs are commonly realized by several small-sized multipliers, an adder tree for summing up the ...
Koppermann, Philipp and De Santis, Fabrizio and Heyszl, Johann and Sigl, Georg
core
Artin reciprocity and Mersenne primes
, 2000 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
On the ratio of the sum of divisors and Euler’s totient function II
, 2014 We find the form of all solutions to ø(n) | σ(n) with three or fewer prime factors, except when the quotient is 4 and n is ...
Qizhi Zhou +3 more
core
Sieve for Mersenne prime numbers
, 2019 The algorithm generates many odd numbers, but only prime numbers of mersenne and not common prime numbers.
openaire +2 more sources
An Algebraic Approach to Symmetric Linear Layers in Cryptographic Primitives
, 2022 Subroto RC.
europepmc +1 more source
The Impact of Mersenne Primes on the Perfection of Numbers
Abstract:This research introduces a novel structural perspective on even perfect numbers, moving beyond the classical summation definition toward an "Anatomy of Disintegration." The study proposes that perfection is an absolute settlement between four internal pillars: the Dividend, the Divisor, the Result, and the inherent "Numerical Potential" (Baza ...
openaire +3 more sources
Unbreakable distributed storage with quantum key distribution network and password-authenticated secret sharing. [PDF]
Sci Rep, 2016 Fujiwara M +5 more
europepmc +1 more source
Una clasificación completa de los números primos de Mersenne y sus implicaciones para la computación
, 2020 A study of Mersenne’s primes is carried out using the multiplicative group modulo 360 and a complete classification is obtained by its residual classes. This allows the search for Mersenne’s primes to be classified into four subgroups mutually exclusive (
Acevedo-Agudelo, Yeisson Alexis
core
Entropy, Periodicity and the Probability of Primality. [PDF]
Entropy (Basel)Croll GJ.
europepmc +1 more source