Results 31 to 40 of about 8,606,543 (158)
Fermat numbers and Mersenne numbers [PDF]
Mathematics of Computation, 1964 This paper gives details of the computations made on an IBM 7090 computer to show that the Fermat number \(F_m = 2^{2^m} +1\) is composite for \(m=14\), and that all the Mersenne numbers \(M_p=2^p-1\) \((5000 < p < 6000)\) are composite. The method used to show that the Fermat number is composite was to compute \(3^{2^n}\) modulo \(F_m\).
Selfridge, J. L., Hurwitz, Alexander
openaire +2 more sources
Nature, 1895 IN 1644 the mathematician Mersenne asserted that out of the 56 primes not < 257, there were only 12 primes, viz.:—
openaire +2 more sources
Quantum Attacks on Mersenne Number Cryptosystems [PDF]
, 2023 Mersenne number based cryptography was introduced by Aggarwal et al. as a potential post- quantum cryptosystem in 2017. Shortly after the publication Beunardeau et al.
Tiepelt, Kevin Marcel
core +1 more source
The search for the largest non Mersenne prime number
, 2021 I bring novelties in the search for the largest non mersenne prime number coming if not at the greatest number very close to ...
Luis Felipe massena misiec (8212830)
core +1 more source
Nature, 1912 AT various times NATURE has inserted notices of the successive discoveries in relation to Mersenne's Numbers. In the issue of August 12, 1909, Colonel Cunningham's discovery that 228479 was a factor of 2P−1 when p = 71 was announced: the other factor was 10334355636337793, but whether this was a prime or not was left undetermined.
openaire +2 more sources
Features of digital signal processing algorithms using Galois fields GF(2n+1).
PLoS ONE, 2023 An alternating representation of integers in binary form is proposed, in which the numbers -1 and +1 are used instead of zeros and ones. It is shown that such a representation creates considerable convenience for multiplication numbers modulo p = 2n+1 ...
Ibragim E Suleimenov +2 more
doaj +1 more source
Security Analysis of LNMNT-LightWeight Crypto Hash Function for IoT
IEEE Access, 2021 Conventional cryptographic techniques are inappropriate for resource-constrained applications in the Internet of Things (IoT) domain because of their high resources requirement.
Nubila Nabeel +2 more
doaj +1 more source
Random number generators with period divisible by a Mersenne prime
, 2003 Colloque avec actes et comité de lecture. internationale.International audiencePseudo-random numbers with long periods and good statistical properties are often required for applications in computational finance.
Brent, Richard, P., Zimmermann, Paul
core +4 more sources
Human Randomness in the Rock-Paper-Scissors Game
Applied Sciences, 2022 In this study, we investigated the human capacity to generate randomness in decision-making processes using the rock-paper-scissors (RPS) game. The randomness of the time series was evaluated using the time-series data of RPS moves made by 500 subjects ...
Takahiro Komai +2 more
doaj +1 more source
MERSENNE AND HADAMARD MATRICES CALCULATION BY SCARPIS METHOD [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2014 Purpose. The paper deals with the problem of basic generalizations of Hadamard matrices associated with maximum determinant matrices or not optimal by determinant matrices with orthogonal columns (weighing matrices, Mersenne and Euler matrices, ets ...
N. A. Balonin +2 more
doaj