New Pseudorandom Number Generator Artin-Sc hreier Tower for p = 5

The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree. Therefore, it is difficult to apply for the construction of huge finite fields. To avoid this problem, we propose a new method to construct huge finite fields with the characteristic p = 5 by using an Artin-Schreier tower. Utilizing the recursive basis of the Artin-Schreier tower, we define a nmltiplication algorithm The algorithm can explicitly calculate the multiplication of two elements on the top finite field of this tower, without any primitive element. We also define a linear recurrence equation as an application, which produces a sequence of numbers, and call the new pseudorandom number generator Abstract Syntax Tree （AST） for p = 5. The experircental results show that our new pseudorandom number generator can produce a sequence of numbers with a long period.

A new pseudorandom number generator based on a complex number chaotic equation

In recent years, various chaotic equation based pseudorandom number generators have been proposed. However, the chaotic equations are all defined in the real number field. In this paper, an equation is proposed and proved to be chaotic in the imaginary axis. And a pseudorandom number generator is constructed based on the chaotic equation. The alteration of the definitional domain of the chaotic equation from the real number field to the complex one provides a new approach to the construction of chaotic equations, and a new method to generate pseudorandorn number sequences accordingly. Both theoretical analysis and experimental results show that the sequences generated by the proposed pseudorandom number generator possess many good properties.

Navigating the Quantum Threat Landscape: Addressing Classical Cybersecurity Challenges

This research paper analyzes the urgent topic of quantum cybersecurity and the current federal quantum-cyber landscape. Quantum-safe implementations within existing and future Internet of Things infrastructure are discussed, along with quantum vulnerabilities in public key infrastructure and symmetric cryptographic algorithms. Other relevant non-encryption-specific areas within cybersecurity are similarly raised. The evolution and expansion of cyberwarfare as well as new developments in cyber defense beyond post-quantum cryptography and quantum key distribution are subsequently explored, with an emphasis on public and private sector awareness and vigilance in maintaining strong security posture.

A novel method of constructing high-dimensional digital chaotic systems on finite-state automata

When chaotic systems are implemented on finite precision machines, it will lead to the problem of dynamical degradation. Aiming at this problem, most previous related works have been proposed to improve the dynamical degradation of low-dimensional chaotic maps. This paper presents a novel method to construct high-dimensional digital chaotic systems in the domain of finite computing precision. The model is proposed by coupling a high-dimensional digital system with a continuous chaotic system. A rigorous proof is given that the controlled digital system is chaotic in the sense of Devaney's definition of chaos. Numerical experimental results for different high-dimensional digital systems indicate that the proposed method can overcome the degradation problem and construct high-dimensional digital chaos with complicated dynamical properties. Based on the construction method, a kind of pseudorandom number generator (PRNG) is also proposed as an application.

A Fast Pseudorandom Number Generator with BLAKE Hash Function

This paper presents a fast pseudorandom generation algorithm,which is based on the BLAKE hash function and can pass the random test of the NIST（National Institute of Standards and Technology） Statistical Test Suite.Through theoretical analysis and experimental imitation,our new algorithm is proven to be more secure and efficient than G-SHA1.Simultaneously,we introduce and discuss the BLAKE in detail.Its security shows that can be utilized to generate pseudorandom bit sequences,which the experimental results show the BLAKE hash function has excellent pseudorandomness.Therefore,we believe the BLAKE is one of the most potential candidate algorithms of SHA-3 program.

Memristive effects on an improved discrete Rulkov neuron model

A change in neuronal-action potential can generate a magnetically induced current during the release and propagation of intracellular ions.To better characterize the electromagnetic-induction effect,this paper presents an improved discrete Rulkov(ID-Rulkov)neuron model by coupling a discrete model of a memristor with sine memductance into a discrete Rulkov neuron model.The ID-Rulkov neuron model possesses infinite invariant points,and its memristor-induced stability effect is evaluated by detecting the routes of period-doubling and Neimark-Sacker bifurcations.We investigated the memristor-induced dynamic effects on the neuron model using bifurcation plots and firing patterns.Meanwhile,we theoretically expounded the memristor initial-boosting mechanism of infinite coexisting patterns.The results show that the ID-Rulkov neuron model can realize diverse neuron firing patterns and produce hyperchaotic attractors that are nondestructively boosted by the initial value of the memristor,indicating that the introduced memristor greatly benefits the original neuron model.The hyperchaotic attractors initially boosted by the memristor were verified by hardware experiments based on a hardware platform.In addition,pseudorandom number generators are designed using the ID-Rulkov neuron model,and their high randomness is demonstrated based onstrict test results.

Modular chaotification model with FPGA implementation

Chaotic systems are an effective tool for various applications, including information security and internet of things. Many chaotic systems may have the weaknesses of incomplete output distributions, discontinuous chaotic regions, and simple chaotic behaviors.These may result in many negative influences in practical applications utilizing chaos. To deal with these issues, this study introduces a modular chaotification model(MCM) to increase the dynamic properties of current one-dimensional(1 D) chaotic maps. To exhibit the effect of the MCM, three 1 D chaotic maps are improved using the MCM as examples. Studies of the resulting properties show the robust and complex dynamics of these improved chaotic maps. Moreover, we implement these improved chaotic maps of MCM in a field-programmable gate array hardware platform and apply them to the application of PRNG. Performance analyses verify that these chaotic maps improved by the MCM have more complicated chaotic behaviors and wider chaotic ranges than the existing and several new chaotic maps.