Results 71 to 80 of about 992 (177)
Efficient and Constant Time Modular Reduction With Generalized Mersenne Primes
Many cryptographic applications require a vast number of modular multiplications with a large prime modulus. Generalized Mersennes are a class of primes commonly used in cryptography because of their special forms.
Serdar S. Erdem, Sezer S. Erdem
doaj +1 more source
Application for Determining Repeatability and Reproducibility in an Honest Gauge R&R Study
ABSTRACT The analysis of variance (ANOVA) method and the range method are employed to conduct gauge repeatability and reproducibility studies. While the range method does not account for the statistical nature of the data, unlike the ANOVA method, it is, on the one hand, faster and, on the other hand, simpler to implement.
Alban Petitjean, Olivier Musset
wiley +1 more source
Groups with triangle‐free graphs on p$p$‐regular classes
Abstract Let p$p$ be a prime. In this paper, we classify the p$p$‐structure of those finite p$p$‐separable groups such that, given any three non‐central conjugacy classes of p$p$‐regular elements, two of them necessarily have coprime lengths.
M. J. Felipe +2 more
wiley +1 more source
Generalized New Mersenne Number Transforms
Two new number theoretic transforms named as odd and odd-squared new Mersenne number transforms are introduced for incorporation into a generalized new Mersenne number transforms (GNMNTs) suite, which are defined in finite fields modulo Mersenne primes where arithmetic operations and residue reductions are simple to implement. This suite is categorized
Boussakta S, Mounir H, Rutter N
openaire +2 more sources
Kenelm Digby's logic of common and natural notions
Abstract In this article, I take a fresh look at the logic of common and natural notions contained in the Two Treatises published in 1644 by Kenelm Digby (1603–1665). Digby's doctrine of common notions was an attempt to retrofit Aristotelianism in order to bring it out of the shadows of scholasticism and into the age of the new experimental and ...
Mogens Lærke
wiley +1 more source
The need for hardware random number generators (HRNGs) that can be integrated in a silicon (Si) complementary-metal–oxide–semiconductor (CMOS) platform has become increasingly important in the era of the Internet-of-Things (IoT).
Kouta Ibukuro +9 more
doaj +1 more source
On generalized Mersenne hybrid numbers
The hybrid numbers are generalization of complex, hyperbolic and dual numbers. In this paper we consider a special kind of hybrid numbers, namely the Mersenne hybrid numbers and we give some of their properties.
Szynal-Liana, Anetta, Włoch, Iwona
openaire +2 more sources
Variable‐Range Hopping Conduction in Amorphous, Non‐Stoichiometric Gallium Oxide
The combination of experimental evidence, ab‐initio DOS calculations and quantitative modeling by kinetic Monte Carlo simulations reveals: Variable‐range hopping (VRH) is the dominant electron conduction mechanism in a‐GaOx (x = 0.8 to 1.0), even at room temperature, which leads to a new, fundamental understanding of a‐GaOx‐based electronic devices ...
Philipp Hein +7 more
wiley +1 more source
AFOCAL SYSTEMS FORMED BY MIRROR OFF-AXIS PARABOLOID
Mirror systems make it possible to reduce device dimensions and its weight while preserving high input aperture and these systems are characterized by a number of other advantages.
N. K. Artiukhina +2 more
doaj +1 more source
Dimorphic Mersenne numbers and their applications
The Mersenne primes are primes which can be written as some prime power of 2 minus 1. These primes were studied from antiquity in that their close connection with perfect numbers and even to present day in that their easiness for primality test. In this paper, we introduce the dimorphic Mersenne numbers as a degenerate version of the Mersenne numbers ...
Kim, Taekyun, Kim, Dae san
openaire +2 more sources

