Listing 1 - 10 of 12 | << page >> |
Sort by
|
Choose an application
The main emphasis of this work is the mathematical theory of quantum channels and their entropic and information characteristics. Quantum information theory is one of the key research areas, since it leads the way to vastly increased computing speeds by using quantum systems to store and process information. Quantum cryptography allows for secure communication of classified information. Research in the field of quantum informatics, including quantum information theory, is in progress in leading scientific centers throughout the world. The past years were marked with impressive progress made by several researchers in solution of some difficult problems, in particular, the additivity of the entropy characteristics of quantum channels. This suggests a need for a book that not only introduces the basic concepts of quantum information theory, but also presents in detail some of the latest achievements.
Information theory in physics. --- Quantum entropy. --- Quantum Computing. --- Quantum Cryptography. --- Quantum Information. --- Quantum Systems. --- Quantum Theory.
Choose an application
This open access book covers the most cutting-edge and hot research topics and fields of post-quantum cryptography. The main purpose of this book is to focus on the computational complexity theory of lattice ciphers, especially the reduction principle of Ajtai, in order to fill the gap that post-quantum ciphers focus on the implementation of encryption and decryption algorithms, but the theoretical proof is insufficient. In Chapter 3, Chapter 4 and Chapter 6, author introduces the theory and technology of LWE distribution, LWE cipher and homomorphic encryption in detail. When using random analysis tools, there is a problem of "ambiguity" in both definition and algorithm. The greatest feature of this book is to use probability distribution to carry out rigorous mathematical definition and mathematical demonstration for various unclear or imprecise expressions, so as to make it a rigorous theoretical system for classroom teaching and dissemination. Chapters 5 and 7 further expand and improve the theory of cyclic lattice, ideal lattice and generalized NTRU cryptography. This book is used as a professional book for graduate students majoring in mathematics and cryptography, as well as a reference book for scientific and technological personnel engaged in cryptography research.
Post-Quantum Cryptography --- Gauss Lattice --- Reduction --- Learning With Errors --- FHE --- Fourier transform --- Ideal lattice --- NTRU --- Smoothing parameters --- Discrete Gaussian measure
Choose an application
Quantum communication --- Quantum communication. --- Quantum communications --- Optical communications --- quantum cryptography --- optical fibre networks --- quantum optics --- quantum computing --- quantum wireless communication --- Teoria quàntica --- Teoria quàntica.
Choose an application
Relativistic quantum information is one of the most exciting fields of physics today. Not only does it open possibilities for new forms of computing but it also calls into question the peaceful coexistence between classical space–time and quantum physics with scenarios that reopen the relationships between locality and nonlocality in the foundational structure of physics. Curated by two international experts Ignazio Licata and Fabrizio Tamburini, this volume hosts a selection of particularly significant essays for the new territories, and is dedicated to the 60th anniversary of Prof. Ignazio Licata.
spacetime entanglement entropy --- Unruh effect --- gravitational force --- thermodynamics --- holographic principle --- simultaneous --- classical communication --- quantum key distribution --- plug-and-play configuration --- optical amplifier --- relativistic quantum information --- quantum cryptography --- summoning --- no-cloning --- no-signalling --- bit commitment --- quantum electrodynamics --- analogue gravity --- Bose-Einstein condensation --- information loss --- cosmological particle creation --- wormholes --- entanglement --- ER = EPR --- Planck scales --- colliding black holes --- quantum hair --- bohr-likr black holes --- n/a
Choose an application
The growth of data-driven technologies, 5G, and the Internet place enormous pressure on underlying information infrastructure. There exist numerous proposals on how to deal with the possible capacity crunch. However, the security of both optical and wireless networks lags behind reliable and spectrally efficient transmission. Significant achievements have been made recently in the quantum computing arena. Because most conventional cryptography systems rely on computational security, which guarantees the security against an efficient eavesdropper for a limited time, with the advancement in quantum computing this security can be compromised. To solve these problems, various schemes providing perfect/unconditional security have been proposed including physical-layer security (PLS), quantum key distribution (QKD), and post-quantum cryptography. Unfortunately, it is still not clear how to integrate those different proposals with higher level cryptography schemes. So the purpose of the Special Issue entitled “Physical-Layer Security, Quantum Key Distribution and Post-quantum Cryptography” was to integrate these various approaches and enable the next generation of cryptography systems whose security cannot be broken by quantum computers. This book represents the reprint of the papers accepted for publication in the Special Issue.
continuous-variable quantum key distribution --- measurement device independent --- zero-photon catalysis --- underwater channel --- quantum key distribution (QKD) --- discrete variable (DV)-QKD --- continuous variable (CV)-QKD --- postquantum cryptography (PQC) --- quantum communications networks (QCNs) --- quantum communications --- entanglement --- surface codes --- quantum cryptography --- quantum key distribution --- quantum network --- measurement-device-independent --- mean-king’s problem --- mean multi-kings’ problem --- information disturbance theorem --- QKD --- distillation --- amplification --- reconciliation --- quantum identity authentication --- private equality tests --- conclusive exclusion --- single-photon mode --- synchronization --- algorithm --- detection probability --- vulnerability --- twin-field quantum key distribution --- phase-matching --- discrete phase randomization --- intrinsic bit error rate --- the Bernstein-Vazirani algorithm --- EPR pairs --- quantum entanglement --- quantum information theory --- geometrical optics restricted eavesdropping --- secret key distillation --- satellite-to-satellite --- physical layer security --- secret key generation --- injection attacks --- jamming attacks --- pilot randomization --- clock synchronization --- Bayesian statistics --- oblivious transfer --- post-quantum cryptography --- universal composability --- n/a --- mean-king's problem --- mean multi-kings' problem
Choose an application
This open access book makes quantum computing more accessible than ever before. A fast-growing field at the intersection of physics and computer science, quantum computing promises to have revolutionary capabilities far surpassing “classical” computation. Getting a grip on the science behind the hype can be tough: at its heart lies quantum mechanics, whose enigmatic concepts can be imposing for the novice. This classroom-tested textbook uses simple language, minimal math, and plenty of examples to explain the three key principles behind quantum computers: superposition, quantum measurement, and entanglement. It then goes on to explain how this quantum world opens up a whole new paradigm of computing. The book bridges the gap between popular science articles and advanced textbooks by making key ideas accessible with just high school physics as a prerequisite. Each unit is broken down into sections labelled by difficulty level, allowing the course to be tailored to the student’s experience of math and abstract reasoning. Problem sets and simulation-based labs of various levels reinforce the concepts described in the text and give the reader hands-on experience running quantum programs. This book can thus be used at the high school level after the AP or IB exams, in an extracurricular club, or as an independent project resource to give students a taste of what quantum computing is really about. At the college level, it can be used as a supplementary text to enhance a variety of courses in science and computing, or as a self-study guide for students who want to get ahead. Additionally, readers in business, finance, or industry will find it a quick and useful primer on the science behind computing’s future.
Particle & high-energy physics --- Computer science --- Teaching of a specific subject --- Quantum Physics --- Quantum Computing --- Computer Science, general --- Science Education --- Quantum Information Technology, Spintronics --- Computer Science --- Spintronics --- Open Access --- Introduction to quantum computing --- quantum computing textbook --- quantum computing for high school students --- introduction to quantum cryptography --- quantum gates --- quantum algorithms --- quantum superposition --- what is a qubit? --- quantum key distribution --- Quantum physics (quantum mechanics & quantum field theory) --- Mathematical theory of computation --- Science: general issues
Choose an application
Cryptography lies at the heart of most technologies deployed today for secure communications. At the same time, mathematics lies at the heart of cryptography, as cryptographic constructions are based on algebraic scenarios ruled by group or number theoretical laws. Understanding the involved algebraic structures is, thus, essential to design robust cryptographic schemes. This Special Issue is concerned with the interplay between group theory, symmetry and cryptography. The book highlights four exciting areas of research in which these fields intertwine: post-quantum cryptography, coding theory, computational group theory and symmetric cryptography. The articles presented demonstrate the relevance of rigorously analyzing the computational hardness of the mathematical problems used as a base for cryptographic constructions. For instance, decoding problems related to algebraic codes and rewriting problems in non-abelian groups are explored with cryptographic applications in mind. New results on the algebraic properties or symmetric cryptographic tools are also presented, moving ahead in the understanding of their security properties. In addition, post-quantum constructions for digital signatures and key exchange are explored in this Special Issue, exemplifying how (and how not) group theory may be used for developing robust cryptographic tools to withstand quantum attacks.
NP-Completeness --- protocol compiler --- post-quantum cryptography --- Reed–Solomon codes --- key equation --- euclidean algorithm --- permutation group --- t-modified self-shrinking generator --- ideal cipher model --- algorithms in groups --- lightweight cryptography --- generalized self-shrinking generator --- numerical semigroup --- pseudo-random number generator --- symmetry --- pseudorandom permutation --- Berlekamp–Massey algorithm --- semigroup ideal --- algebraic-geometry code --- non-commutative cryptography --- provable security --- Engel words --- block cipher --- cryptography --- beyond birthday bound --- Weierstrass semigroup --- group theory --- braid groups --- statistical randomness tests --- group-based cryptography --- alternating group --- WalnutDSA --- Sugiyama et al. algorithm --- cryptanalysis --- digital signatures --- one-way functions --- key agreement protocol --- error-correcting code --- group key establishment
Choose an application
This Special Issue provides an opportunity for researchers in the area of side-channel attacks (SCAs) to highlight the most recent exciting technologies. The research papers published in this Special Issue represent recent progress in the field, including research on power analysis attacks, cache-based timing attacks, system-level countermeasures, and so on.
n/a --- binary Huff curve --- FPGA --- post quantum cryptography --- data loss --- side-channel cache attacks --- rsa cryptosystem --- first-order analysis --- chaotic circuit --- integrity --- ad libraries --- power-analysis attack --- single trace analysis --- side-channel authentication --- provable security --- ad lib --- cache misses --- cache side-channel attack --- leakage model --- NTRU --- graph --- AES --- hardware security --- recovery of secret exponent by triangular trace analysis --- side-channel attacks --- information leakage --- data outsourcing --- CPLD --- scatter-gather implementation --- modular exponentiation --- lattice-based cryptography --- elliptic curve cryptography --- Gaussian sampling --- post-quantum cryptography --- reliability --- unified point addition --- ad networks --- graph similarity --- mobile ads --- physically unclonable function --- tweakable block cipher --- Merkle (hash) tree --- machine-learning classification --- side channel attack --- online authentication --- side channel analysis --- financial IC card --- side-channel attack --- re-keying --- cloud computing --- cryptographic keys --- chaos theory --- horizontal collision correlation analysis --- countermeasure --- embedded system security --- cache attack --- single-trace attack --- software development kit (SDK) --- CDT sampling --- key bit-dependent attack --- side-channel analysis --- second-order analysis --- constant-time cryptographic algorithm --- android package (APK) --- challenge-response authentication
Choose an application
"The P-NP problem is the most important open problem in computer science, if not all of mathematics. The Golden Ticket provides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this informative and entertaining book, Lance Fortnow traces how the problem arose during the Cold War on both sides of the Iron Curtain, and gives examples of the problem from a variety of disciplines, including economics, physics, and biology. He explores problems that capture the full difficulty of the P-NP dilemma, from discovering the shortest route through all the rides at Disney World to finding large groups of friends on Facebook. But difficulty also has its advantages. Hard problems allow us to safely conduct electronic commerce and maintain privacy in our online lives. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of the P-NP problem"--
Computer science --- NP-complete problems. --- Computer algorithms. --- Problems, NP-complete --- Computational complexity --- Algorithms --- NP-complete problems --- Computer algorithms --- Mathematics --- Physical Sciences & Mathematics --- Algebra --- MATHEMATICS / Mathematical Analysis. --- MATHEMATICS / Linear Programming. --- MATHEMATICS / History & Philosophy. --- COMPUTERS / Programming / Algorithms. --- Facebook. --- Frenemy. --- Hamiltonian paths. --- Internet. --- Ketan Mulmuley. --- Leonid Levin. --- Martin Hellman. --- NP problem. --- NP problems. --- NP-complete. --- P versus NP problem. --- P versus NP. --- Richard Feynman. --- Steve Cook. --- Twitter. --- Urbana algorithm. --- Whitfield Diffie. --- academic work. --- algebraic geometry. --- algorithm. --- algorithms. --- approximation. --- big data. --- computational problems. --- computer science. --- computers. --- computing. --- cryptography. --- cryptosystem. --- database. --- decryption. --- digital computers. --- efficient algorithms. --- efficient computation. --- encryption. --- factoring. --- fast computers. --- graph isomorphism. --- heuristics. --- linear programming. --- mathematics. --- max-cut. --- network security. --- networking. --- new technologies. --- parallel computation. --- perebor. --- prime numbers. --- problems. --- programming. --- public-key cryptography. --- quantum computers. --- quantum computing. --- quantum cryptography. --- quantum mechanics. --- quantum physical systems. --- research community. --- secret messages. --- social networking data. --- solution. --- teleportation.
Choose an application
This open access book presents selected papers from International Symposium on Mathematics, Quantum Theory, and Cryptography (MQC), which was held on September 25-27, 2019 in Fukuoka, Japan. The international symposium MQC addresses the mathematics and quantum theory underlying secure modeling of the post quantum cryptography including e.g. mathematical study of the light-matter interaction models as well as quantum computing. The security of the most widely used RSA cryptosystem is based on the difficulty of factoring large integers. However, in 1994 Shor proposed a quantum polynomial time algorithm for factoring integers, and the RSA cryptosystem is no longer secure in the quantum computing model. This vulnerability has prompted research into post-quantum cryptography using alternative mathematical problems that are secure in the era of quantum computers. In this regard, the National Institute of Standards and Technology (NIST) began to standardize post-quantum cryptography in 2016. This book is suitable for postgraduate students in mathematics and computer science, as well as for experts in industry working on post-quantum cryptography.
Applied mathematics. --- Engineering mathematics. --- Data structures (Computer science). --- Quantum computers. --- Computer security. --- Mathematical and Computational Engineering. --- Data Structures and Information Theory. --- Quantum Computing. --- Systems and Data Security. --- Computer privacy --- Computer system security --- Computer systems --- Computers --- Cyber security --- Cybersecurity --- Electronic digital computers --- Protection of computer systems --- Security of computer systems --- Data protection --- Security systems --- Hacking --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- Electronic data processing --- File organization (Computer science) --- Abstract data types (Computer science) --- Engineering --- Engineering analysis --- Mathematical analysis --- Protection --- Security measures --- Mathematics --- Mathematical and Computational Engineering --- Data Structures and Information Theory --- Quantum Computing --- Systems and Data Security --- Mathematical and Computational Engineering Applications --- Data and Information Security --- Cryptography for Quantum Computers --- Post-quantum Cryptography --- Number Theory --- Representation Theory --- Quantum Physics --- Security Modelling --- Open Access --- Maths for engineers --- Algorithms & data structures --- Information theory --- Mathematical theory of computation --- Computer security --- Network security --- Data structures (Computer science)
Listing 1 - 10 of 12 | << page >> |
Sort by
|