Results 81 to 90 of about 524 (199)
NeonCROSS: Vectorized Implementation of Post-Quantum Signature CROSS on Cortex-A72 and Apple M3
Transactions on Cryptographic Hardware and Embedded SystemsThe advancement of quantum computing threatens traditional public-key cryptographic systems, prompting the development of post-quantum cryptography (PQC).
Hanyu Wei, Wenqian Li, Yunlei Zhao
doaj +1 more source
Mersenne Numbers: consolidated results
, 1986 This document provides and comments on the results of the Lucas-Lehmer testing and/or partial factorisation of all Mersenne Numbers Mp = 2^p-1 where p is prime and less than 100,000. Previous computations have either been confirmed or corrected.
Hunt, David +4 more
core
On integer sequences in cryptography
Journal of Mathematical CryptologyInteger 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
Teste de Lucas-Lehmer para primos de Mersenne
, 2022 The present work aims at a small summary of Mersenne's prime numbers and, consequently, prime numbers, a subject that has shown to have a certain relevance because of the increase in users of applications that use RSA encryption to protect their data ...
SANTOS, Elbi Jesus dos
core
This is a unique system for finding Mersenne Primes Deveolped by Branden Lee ...
openaire +2 more sources
Evaluating Mersenne Primes Using a Single Quadrant Expanding Square
, 2012 By forming a table of sequential odd numbers using a single quadrant expanding square pattern it was observed that multiple Mersenne primes fall into the first column. We prove that the Mersenne primes which fall into the first column will be of the form
Sprague, Douglas +5 more
core +1 more source
On Generalized Mersenne and Fermat Primes
, 2009 The classical Merseniie and Fermat primes are, respectivel3^ primes of the form 2^\u27 - 1 and 2^‘ + 1. The Mersenne primes have been studied since antiquity. It is known that if 2^ - 1 is prime then k is prime.
Putnam, Bette Catherine
core
Proof of exponentiation: enhanced prover efficiency for algebraic statements
CybersecurityRecent 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
On prime factors of Mersenne numbers
, 2016 to appear in Palestine Journal of ...
Cambraia, Ady jun. +4 more
openaire +3 more sources
Strongly Base-Two Groups. [PDF]
Vietnam J Math, 2023 Burness TC, Guralnick RM.
europepmc +1 more source