Results 31 to 40 of about 180 (147)
Journal of Applied Crystallography, Volume 58, Issue 6, Page 2078-2089, December 2025.We experimentally demonstrate that the scattering‐induced decrease in light intensity experienced by a crystal embedded in a high‐viscosity jet is very limited in materials such as lipidic cubic phase or hydroxyethyl cellulose, and therefore cannot justify the use of pump energies exceeding the linear excitation regime under realistic experimental ...
Stanisław Niziński +5 more
wiley +1 more source
Engineering Reports, Volume 7, Issue 10, October 2025.StorjLedger leverages erasure‐coded sharding and Proof‐of‐Storage to deliver nearly 1000 transactions per second with sub‐second latency, 98% data redundancy, and 76% lower storage costs, resolving the blockchain trilemma by harmonizing scalability, security, and decentralization.
Saha Reno, Koushik Roy
wiley +1 more source
Groups with triangle‐free graphs on p$p$‐regular classes
Mathematische Nachrichten, Volume 298, Issue 6, Page 1796-1807, June 2025.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
Efficient and Constant Time Modular Reduction With Generalized Mersenne Primes
IEEE AccessMany 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
Variable‐Range Hopping Conduction in Amorphous, Non‐Stoichiometric Gallium Oxide
Advanced Electronic Materials, Volume 11, Issue 4, April 2025.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
Mersenne Primes in Real Quadratic Fields
, 2012 The concept of Mersenne primes is studied in real quadratic fields of class number 1. Computational results are given. The field $Q(\sqrt{2})$ is studied in detail with a focus on representing Mersenne primes in the form $x^{2}+7y^{2}$. It is also proved that $x$ is divisible by 8 and $y\equiv \pm3\pmod{8}$ generalizing the result of F Lemmermeyer ...
Palimar, Sushma, Shankar, B. R.
openaire +3 more sources
Efficient arithmetic in (pseudo-)mersenne prime order fields
Advances in Mathematics of Communications, 2022 <p style='text-indent:20px;'>Elliptic curve cryptography is based upon elliptic curves defined over finite fields. Operations over such elliptic curves require arithmetic over the underlying field. In particular, fast implementations of multiplication and squaring over the finite field are required for performing efficient elliptic curve ...
Nath, Kaushik, Sarkar, Palash
openaire +2 more sources
A characterization of some finite simple groups by their character codegrees
Mathematische Nachrichten, Volume 298, Issue 4, Page 1356-1369, April 2025.Abstract Let G$G$ be a finite group and let χ$\chi$ be a complex irreducible character of G$G$. The codegree of χ$\chi$ is defined by cod(χ)=|G:ker(χ)|/χ(1)$\textrm {cod}(\chi)=|G:\textrm {ker}(\chi)|/\chi (1)$, where ker(χ)$\textrm {ker}(\chi)$ is the kernel of χ$\chi$.
Hung P. Tong‐Viet
wiley +1 more source
On the emergence of the Quanta Prime sequence
Arab Journal of Basic and Applied SciencesThis paper presents the Quanta Prime Sequence (QPS) and its foundational theorem, showcasing a unique class of polynomials with substantial implications.
Moustafa Ibrahim
doaj +1 more source
Batched ranged random integer generation
Software: Practice and Experience, Volume 55, Issue 1, Page 155-169, January 2025.Summary Pseudorandom values are often generated as 64‐bit binary words. These random words need to be converted into ranged values without statistical bias. We present an efficient algorithm to generate multiple independent uniformly‐random bounded integers from a single uniformly‐random binary word, without any bias.
Nevin Brackett‐Rozinsky, Daniel Lemire
wiley +1 more source