Results 81 to 90 of about 384 (160)
Strongly Base-Two Groups. [PDF]
Vietnam J Math, 2023 Burness TC, Guralnick RM.
europepmc +1 more source
Automatic Generation of High-Performance Modular Multipliers for Arbitrary Mersenne Primes on FPGAs [PDF]
, 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
On prime factors of Mersenne numbers
, 2016 to appear in Palestine Journal of ...
Cambraia, Ady jun. +4 more
openaire +3 more sources
Covert Channel Communication as an Emerging Security Threat in 2.5D/3D Integrated Systems. [PDF]
Sensors (Basel), 2023 Miketic I, Dhananjay K, Salman E.
europepmc +1 more source
On the ratio of the sum of divisors and Euler’s totient function II [PDF]
, 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
On inversion modulo pseudo-Mersenne primes [PDF]
, 2020 It is well established that the method of choice for implementing a side-channel secure modular inversion, is to use Fermat\u27s little theorem. So $1/x = x^{p-2} \bmod p$. This can be calculated using any multiply-and-square method safe in the knowledge
Michael Scott
core
High-Speed and Unified ECC Processor for Generic Weierstrass Curves over GF(p) on FPGA. [PDF]
Sensors (Basel), 2021 Awaludin AM, Larasati HT, Kim H.
europepmc +1 more source
This paper tackles a longstanding problem in number theory: the existence of odd perfect numbers. A perfect number is defined as a positive integer whose sum of all its proper divisors (excluding itself) is equal to twice the number itself. While Euclid demonstrated a method to construct even perfect numbers using Mersenne primes (primes of the form $2^
openaire +1 more source
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
Post-Quantum Security: Opportunities and Challenges. [PDF]
Sensors (Basel), 2023 Li S +7 more
europepmc +1 more source