Classification of subgroups of symplectic groups over finite fields\n containing a transvection [PDF]
Sara Arias‐de‐Reyna +2 more
openalex +1 more source
Magnetic field distribution of silver blood cancer with finite difference time domain (FDTD) simulation [PDF]
Vinda Zakiyatuz Zulfa +6 more
openalex +1 more source
Breaking the Capacity Limit for WO3 Anode‐Based Li‐Ion Batteries Using Photo‐Assisted Charging
This image illustrates a photo‐assisted rechargeable lithium‐ion battery. (a) shows the battery structure, where light enhances electron‐hole generation in the anode, boosting ion flow. (b) compares discharging performance, revealing over 60% higher capacity under light compared to dark conditions, showcasing the benefit of light‐assisted energy ...
Rabia Khatoon +7 more
wiley +1 more source
Ternary cyclotomic numbers and ternary Jacobi sums
Cyclotomic numbers and Jacobi sums, introduced over two centuries ago by Gauss and Jacobi, respectively, are pivotal in number theory and find wide applications in combinatorial designs, coding theory, cryptography, and information theory. The cyclotomic
Zhichao Tang , Xiang Fan
doaj +1 more source
A new DNA-based model for finite field arithmetic. [PDF]
Jirón I +4 more
europepmc +1 more source
$f$-Diophantine sets over finite fields via quasi-random hypergraphs from multivariate polynomials [PDF]
Seoyoung C. Kim, Chi Hoi Yip, Semin Yoo
openalex +1 more source
Enumeration of Commuting Pairs in Lie Algebras over Finite Fields [PDF]
Jason Fulman, Robert M. Guralnick
openalex +1 more source
Experimental and Theoretical Confirmation of Covalent Bonding in α‐Pu
From a combination of Reverse Monte Carlo dynamic rigid body fitting to the pair distribution functional and novel density functional approaches, the existence of covalent bonding is confirmed in α‐plutonium alongside other bonding types (i.e. mixed bonding schemes).
Alexander R. Muñoz +10 more
wiley +1 more source
Efficient Scalar Multiplication of ECC Using Lookup Table and Fast Repeating Point Doubling
Reducing the computation time of scalar multiplication for elliptic curve cryptography is a significant challenge. This study proposes an efficient scalar multiplication method for elliptic curves over finite fields GF(2m).
Fu-Jung Kan +3 more
doaj +1 more source
New Binomial Bent Function over the Finite Fields of Odd Characteristic [PDF]
Tor Helleseth, Alexander Kholosha
openalex +1 more source

