Related papers: A new technique for ultra-fast physical random num…
Chaotic maps are very important for establishing chaos-based image encryption systems. This paper introduces a coupling chaotic system based on a certain unit transform, which can combine any two 1D chaotic maps to generate a new one with…
Pseudo-Random Bit Generation (PRBG) is required in many aspects of cryptography as well as in other applications of modern security engineering. In this work, PRBG based on 2D symmetrical chaotic mappings of logistic type is considered. The…
The speed of a quantum random number generator is essential for practical applications, such as high-speed quantum key distribution systems. Here, we push the speed of a quantum random number generator to 68 Gbps by operating a laser around…
Random number generators are essential to ensure performance in information technologies, including cryptography, stochastic simulations and massive data processing. The quality of random numbers ultimately determines the security and…
We demonstrate a 10-GHz bandwidth digitizer with 7-effective bits of resolution and 52dB SFDR, using photonic time stretch technique. To the best of our knowledge, this is the highest resolution analog-to-digital converter (ADC) of the same…
Weakly coupled semiconductor superlattices under dc voltage bias are nonlinear systems with many degrees of freedom whose nonlinearity is due to sequential tunneling of electrons. They may exhibit spontaneous chaos at room temperature and…
Quantum random number generators employ the inherent randomness of quantum mechanics to generate truly unpredictable random numbers, which are essential in cryptographic applications. While a great variety of quantum random number…
Generation and control of entanglement are fundamental tasks in quantum information processing. In this paper, we propose a novel approach to generate controllable frequency-entangled photons by using the concept of synthetic frequency…
Topological defects play a key role in nonequilibrium phase transitions, ranging from birth of the early universe to quantum critical behavior of ultracold atoms. In solids, transient defects are known to generate a variety of hidden orders…
We implement a quantum random number generator based on a balanced homodyne measurement of vacuum fluctuations of the electromagnetic field. The digitized signal is directly processed with a fast randomness extraction scheme based on a…
In this paper, a new pseudo-random number generator (PRNG) based on chaotic iterations is proposed. This method also combines the digits of two XORshifts PRNGs. The statistical properties of this new generator are improved: the generated…
Here in this paper we are presenting a digital system background technique for correcting the time offset error rate and gain mismatches in a time interleaved analog to digital converter system for N channel communication using 8 bit…
Optical chaos holds great promise for secure communication, LiDAR, and reinforcement learning. However, its scalability has long been constrained by an intrinsic trade-off between bandwidth and the number of parallel chaotic channels. Here,…
This letter proposes using intermittent chaotic clocks, generated from chaotic maps, to drive cryptographic chips running the Advanced Encryption Standard as a countermeasure against Correlation Power Analysis attacks. Five different…
This letter proposes a fast implementation of the regularity-constrained discrete sine transform (R-DST). The original DST \textit{leaks} the lowest frequency (DC: direct current) components of signals into high frequency (AC: alternating…
This work presents new techniques to produce true random bits by exploiting single photon time of arrival. Two FPGA-based QRNG devices are presented: Randy which uses one discrete SPAD and LinoSPAD which uses a CMOS SPAD array, along with a…
In this paper, we analyze several critical issues in semi-device independent quantum information processing protocol. In practical experimental realization randomness generation in that scenario is possible only if the efficiency of the…
Given a combinatorial decomposition for a counting problem, we resort to the simple scheme of approximating large numbers by floating-point representations in order to obtain efficient Fully Polynomial Time Approximation Schemes (FPTASes)…
In recent years, the generation of rigorously provable chaos in finite precision digital domain has made a lot of progress in theory and practice, this article is a part of it. It aims to improve and expand the theoretical and application…
This paper investigates asynchronous multiple-input multiple-output (MIMO) massive unsourced random access (URA) in an orthogonal frequency division multiplexing (OFDM) system over frequency-selective fading channels, with the presence of…