This book provides an overview of state-of-the-art implementations of quantum random number generators (QRNGs), and especially examines their relation to classical statistical randomness models and numerical techniques for computing random numbers. The reader – who ideally has a background in classical statistics, computer science, or cryptography – is introduced to the world of quantum bits step by step, and explicit relations between QRNGs and their classical counterparts are identified along the way. Random number generation is a major pillar of cryptography. Capitalizing on the randomness inherent in quantum phenomena is a rapidly evolving branch of quantum cryptography with countless applications for the future. The value of quantum randomness for cryptographic purposes is empirically demonstrated in statistical evaluations of QRNGs’ performance compared to classical techniques for true and pseudorandom number generation. The book then provides an overview of technical implementations of QRNGs, before a concluding discussion of major achievements and remaining obstacles in the field rounds out the coverage, while also opening the door for future research directions.

Will your organization be protected the day a quantum computer breaks encryption on the internet? Computer encryption is vital for protecting users, data, and infrastructure in the digital age. Using traditional computing, even common desktop encryption could take decades for specialized ‘crackers’ to break and government and infrastructure-grade encryption would take billions of times longer. In light of these facts, it may seem that today’s computer cryptography is a rock-solid way to safeguard everything from online passwords to the backbone of the entire internet. Unfortunately, many current cryptographic methods will soon be obsolete. In 2016, the National Institute of Standards and Technology (NIST) predicted that quantum computers will soon be able to break the most popular forms of public key cryptography. The encryption technologies we rely on every day—HTTPS, TLS, WiFi protection, VPNs, cryptocurrencies, PKI, digital certificates, smartcards, and most two-factor authentication—will be virtually useless. . . unless you prepare. Cryptography Apocalypse is a crucial resource for every IT and InfoSec professional for preparing for the coming quantum-computing revolution. Post-quantum crypto algorithms are already a reality, but implementation will take significant time and computing power. This practical guide helps IT leaders and implementers make the appropriate decisions today to meet the challenges of tomorrow. This important book: Gives a simple quantum mechanics primer Explains how quantum computing will break current cryptography Offers practical advice for preparing for a post-quantum world Presents the latest information on new cryptographic methods Describes the appropriate steps leaders must take to implement existing solutions to guard against quantum-computer security threats Cryptography Apocalypse: Preparing for the Day When Quantum Computing Breaks Today's Crypto is a must-have guide for anyone in the InfoSec world who needs to know if their security is ready for the day crypto break and how to fix it.

Random Number Generators, Principles and Practices has been written for programmers, hardware engineers, and sophisticated hobbyists interested in understanding random numbers generators and gaining the tools necessary to work with random number generators with confidence and knowledge. Using an approach that employs clear diagrams and running code examples rather than excessive mathematics, random number related topics such as entropy estimation, entropy extraction, entropy sources, PRNGs, randomness testing, distribution generation, and many others are exposed and demystified. If you have ever Wondered how to test if data is really random Needed to measure the randomness of data in real time as it is generated Wondered how to get randomness into your programs Wondered whether or not a random number generator is trustworthy Wanted to be able to choose between random number generator solutions Needed to turn uniform random data into a different distribution Needed to ensure the random numbers from your computer will work for your cryptographic application Wanted to combine more than one random number generator to increase reliability or security Wanted to get random numbers in a floating point format Needed to verify that a random number generator meets the requirements of a published standard like SP800-90 or AIS 31 Needed to choose between an LCG, PCG or XorShift algorithm Then this might be the book for you.

This book presents interesting, important unsolved problems in the mathematical and computational sciences. The contributing authors are leading researchers in their fields and they explain outstanding challenges in their domains, first by offering basic definitions, explaining the context, and summarizing related algorithms, theorems, and proofs, and then by suggesting creative solutions. The authors feel a strong motivation to excite deep research and discussion in the mathematical and computational sciences community, and the book will be of value to postgraduate students and researchers in the areas of theoretical computer science, discrete mathematics, engineering, and cryptology.

The chapters in this open access book arise out of the EU Cost Action project Cryptacus, the objective of which was to improve and adapt existent cryptanalysis methodologies and tools to the ubiquitous computing framework. The cryptanalysis implemented lies along four axes: cryptographic models, cryptanalysis of building blocks, hardware and software security engineering, and security assessment of real-world systems. The authors are top-class researchers in security and cryptography, and the contributions are of value to researchers and practitioners in these domains. This book is open access under a CC BY license.

This book gathers the proceedings of the Third International Conference on Computational Advancement in Communication Circuits and Systems (ICCACCS 2020), organized virtually by Narula Institute of Technology, Kolkata, India. The book presents peer-reviewed papers that highlight new theoretical and experimental findings in the fields of electronics and communication engineering, including interdisciplinary areas like advanced computing, pattern recognition and analysis, and signal and image processing. The respective papers cover a broad range of principles, techniques, and applications in microwave devices, communication and networking, signal and image processing, computations and mathematics, and control.

The last few years have been characterized by a tremendous development of quantum information and probability and their applications, including quantum computing, quantum cryptography, and quantum random generators. In spite of the successful development of quantum technology, its foundational basis is still not concrete and contains a few sandy and shaky slices. Quantum random generators are one of the most promising outputs of the recent quantum information revolution. Therefore, it is very important to reconsider the foundational basis of this project, starting with the notion of irreducible quantum randomness. Quantum probabilities present a powerful tool to model uncertainty. Interpretations of quantum probability and foundational meaning of its basic tools, starting with the Born rule, are among the topics which will be covered by this issue. Recently, quantum probability has started to play an important role in a few areas of research outside quantum physics—in particular, quantum probabilistic treatment of problems of theory of decision making under uncertainty. Such studies are also among the topics of this issue.