English
Related papers

Related papers: Hardware Implementation of Double Pendulum Pseudo …

200 papers

This thesis focuses on quantum information processing using the superconducting device, especially, on realizing quantum gates and algorithms in open quantum systems. Such a device is constructed by transmon-type superconducting qubits…

Quantum Physics · Physics 2024-01-17 Hamid Sakhouf

We demonstrate on-chip quantum random number generation at high data rates using the random phases of gain-switched laser pulses. Interference of the gain-switched pulses produced by two independent semiconductor lasers is performed on a…

We present a semi-device-independent quantum random number generator (QRNG) based on the violation of a contextuality inequality, implemented by the integration of two silicon photonic chips. Our system combines a heralded single-photon…

In this paper we present experiments in order to show how some pseudo random number generators can improve the effectiveness of a statistical cryptanalysis algorithm. We deduce mainly that a better generator enhance the accuracy of the…

Cryptography and Security · Computer Science 2014-09-19 O. Benamara , F. Merazka

Pseudo-Random Numbers Generators (PRNGs) are algorithms produced to generate long sequences of statistically uncorrelated numbers, i.e. Pseudo-Random Numbers (PRNs). These numbers are widely employed in mid-level cryptography and in…

Cryptography and Security · Computer Science 2019-12-30 Luca Pasqualini , Maurizio Parton

Electronic systems for qubit control and measurement serve as a bridge between quantum programming language and quantum information processors. With the rapid development of superconducting quantum circuit (SQC) technology, synchronization…

Randomness is fundamental for secure communication and information processing. While continuous-variable optical systems offer an attractive platform for this task, certifying genuine quantum randomness in such setups remains challenging.…

For globally connected devices like smart phones, personal computers and Internet-of-things devices, the ability to generate random numbers is essential for execution of cryptographic protocols responsible for information security.…

Quantum Physics · Physics 2021-02-25 Mario Stipčević , Ivan Michel Antolović , Claudio Bruschini , Edoardo Charbon

Security of information transmitted through the Internet, against passive or active attacks is an international concern. The use of a chaos-based pseudo-random bit sequence to make it unrecognizable by an intruder, is a field of research in…

Cryptography and Security · Computer Science 2010-04-15 Qianxue Wang , Christophe Guyeux , Jacques M. Bahi

Randomness is a very important resource for cryptography, algorithms, and scientific simulations. Since all classical processes are considered to be intrinsically deterministic, we must build quantum random number generators which utilize…

Quantum Physics · Physics 2022-04-08 Xing Chen , Minsik Kwon , Vadim Vorobyov , Jörg Wrachtrup , Ilja Gerhardt

We study potential security vulnerabilities of a single-photon detector based on superconducting transition-edge sensor. In a simple experiment, we show that an adversary could fake a photon number result at a certain wavelength by sending…

Quantum Physics · Physics 2022-09-13 Poompong Chaiwongkhot , Jiaqiang Zhong , Anqi Huang , Hao Qin , Sheng-cai Shi , Vadim Makarov

Cryptography is always very important in data origin authentications, entity authentication, data integrity and confidentiality. In recent years, a variety of chaotic cryptographic schemes have been proposed. These schemes have typical…

Cryptography and Security · Computer Science 2012-02-08 Sodeif Ahadpour , Yaser Sadra , Zahra ArastehFard

This paper presents digital hardware for computing polynomial multiplication using Number Theoretic Transform (NTT), specifically designed for implementation on Field Programmable Gate Arrays (FPGAs). Multiplying two large polynomials…

Hardware Architecture · Computer Science 2025-01-22 Moslem Heidarpur , Mitra Mirhassani , Norman Chang

Many simulation applications require the generation of long sequences of pseudo-random numbers. Linear recurrences modulo 2 are commonly used as the fundamental building block for constructing pseudo-random number generators with extended…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-19 Fabio Cannizzo

Quantum computing has been on the rise in recent years, evidenced by a surge in publications on quantum software engineering and testing. Progress in quantum hardware has also been notable, with the introduction of impressive systems like…

Software Engineering · Computer Science 2024-10-03 Sinhué García Gil , Luis Llana Díaz , José Ignacio Requeno Jarabo

Approximate computing is a promising approach to reduce the power, delay, and area in hardware design for many error-resilient applications such as machine learning (ML) and digital signal processing (DSP) systems, in which multipliers…

Hardware Architecture · Computer Science 2023-10-31 Zhen Li , Hao Zhou , Lingli Wang

Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g. in computation, communication and control. Fully random transformations require exponential time for either classical or quantum…

Quantum Physics · Physics 2016-05-04 Fernando G. S. L. Brandao , Aram W. Harrow , Michal Horodecki

Pseudorandomness has played a central role in modern cryptography, finding theoretical and practical applications to various fields of computer science. A function that generates pseudorandom strings from shorter but truly random seeds is…

Formal Languages and Automata Theory · Computer Science 2016-10-25 Tomoyuki Yamakami

We introduce a method for non-uniform random number generation based on sampling a physical process in a controlled environment. We demonstrate one proof-of-concept implementation of the method that reduces the error of Monte Carlo…

Other Computer Science · Computer Science 2020-04-24 James Timothy Meech , Phillip Stanley-Marbell

The aim of this paper is to show that Digital Signal Processors (DSPs) can be used to efficiently implement complex algorithms. As an example we have chosen the problem of enumerating closed two-dimensional random paths. An Evaluation…

Computational Physics · Physics 2007-05-23 B. Afsari , N. Sadeghi-Meybodi , S. Rouhani