Results 91 to 100 of about 39,822 (114)

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  

TurboBlom: A light and resilient key predistribution scheme with application to Internet of Things. [PDF]

PLoS One
Khabbazian M, Safavi-Naini R, Shabani-Baghani A.   +2 more
europepmc   +1 more source

Pipelined and conflict-free number theoretic transform accelerator for CRYSTALS-Kyber on FPGA. [PDF]

PLoS One
Waris A, Aziz A, Khan BM.
europepmc   +1 more source

Which factors influence plan reuse in a sequential posture selection task? [PDF]

Front Psychol
Schütz C.
europepmc   +1 more source

Red light and biostimulants containing arbuscular mycorrhizal fungi enhance ajmalicine and serpentine production in Catharanthus roseus under indoor conditions. [PDF]

Sci Rep
Quadri A, Sambuco B, Trenta M, Tassinari P, Torreggiani D, Mercolini L, Protti M, Zambonelli A, Puliga F, Barbaresi A.   +9 more
europepmc   +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  

Algorithm-assisted discovery of an intrinsic order among mathematical constants. [PDF]

Proc Natl Acad Sci U S A
Elimelech R, David O, De la Cruz Mengual C, Kalisch R, Berndt W, Shalyt M, Silberstein M, Hadad Y, Kaminer I.   +8 more
europepmc   +1 more source

Methods for searching Mersenne primes

Prime numbers, the integers greater than one that are only divisible by one and themselves, are an important subset of natural numbers. They are mathematically interesting due to the fundamental theorem or arithmetic: every positive integer can be ...
Mäkelä, Väinö
core  

On the generating functions of Mersenne and Fermat primes [PDF]

Collectanea Mathematica, 2010
With the aid of Solomon Golomb formula we give closed formulas for the generating functions of Mersenne and Fermat primes. A limit-type criteria for the existence of an infinite number of such primes is given using these generating functions.Fil: Panzone,
Panzone, Pablo Andres, Pablo A. Panzone
exaly   +2 more sources

A Technique for Image Encryption Using the Modular Multiplicative Inverse Property of Mersenne Primes

Symmetry
Mersenne prime numbers, expressed in the form (2n − 1), have long captivated researchers due to their unique properties. The presented work aims to develop a symmetric cryptographic algorithm using a novel technique based on the logical properties ...
Shanooja M. A., Anil Kumar M. N.
exaly   +2 more sources