Results 101 to 110 of about 385 (161)

Conic curve encryption and digital signature based on complex number theory for cybersecurity applications. [PDF]

Sci Rep
Kamal A, El-Kamchochi HA, El-Fahar A, Hagras EAA.   +3 more
europepmc   +1 more source

LETTER Special Section on Cryptography and Information Security Simple Power Analysis on Fast Modular Reduction with

, 2006
SUMMARY We discuss side channel leakage from modular reduction for NIST recommended domain parameters. FIPS 186-2 has 5 recommended prime fields. These primes have a special form which is referred to as generalized Mersenne prime.
Generalized Mersenne, Curve Cryptosystems, Prime Elliptic   +2 more
core  

Primed for Discovery. [PDF]

Biochemistry
Walker AS, Clardy J.
europepmc   +1 more source

On prime divisors of Mersenne numbers [PDF]

Acta Arithmetica, 1991
Carl Pomerance, Péter Kiss, Paul Erdős
openaire   +1 more source

Generalized Mersenne Numbers

, 1999
. There is a well known shortcut for modular multiplication modulo a Mersenne number, performing modular reduction without integer division. We generalize this technique to a larger class of primes, and discuss parameter choices which are particularly ...
Jerome A. Solinas
core  

Extending the IEEE 802.15.4 security suite with a compact implementation of the NIST P-192/B-163 elliptic curves. [PDF]

Sensors (Basel), 2013
de la Piedra A, Braeken A, Touhafi A.
europepmc   +1 more source

The Mersenne Chain Reactor: A Physical Saturation Law for Mersenne Primes

Abstract The search for Mersenne primes at astronomical scales has reached a physical bottleneck: as numbers grow, the energy and time required for arithmetic verification become prohibitive on classical processors. Here we report a fundamental paradigm shift in the physics of computation and information.
Moustafa Ibrahim, Belal Ibrahim, Rawan Ibrahim   +2 more
openaire   +1 more source

Mersenne primes and the proof of the Lucas-Lehmer test

V magistrskem delu so obravnavana Mersennova praštevila in Lucas-Lehmerjev test. Mersennova praštevila, ki so oblike 2^p-1, kjer je p praštevilo, so tudi največja znana praštevila. Njihovo praštevilskost preverjamo z Lucas-Lehmerjevim testom, ki je podan
Zupančič, Andrej
core  

Probable prime tests for generalized mersenne numbers

, 2008
The classical Lucas-Lehmer test gives necessary and sufficient conditions for the primality of 2 p -1, p an odd prime. Such primes are called Mersenne primes.
Melham, RS
core  

Joint assembly and genetic mapping of the Atlantic horseshoe crab genome reveals ancient whole genome duplication. [PDF]

Gigascience, 2014
Nossa CW, Havlak P, Yue JX, Lv J, Vincent KY, Brockmann HJ, Putnam NH.   +6 more
europepmc   +1 more source