A quick glance at quantum cryptography
The recent application of the principles of quantum mechanics to cryptography. Now possible to construct cryptographic communication systems which detect unauthorized eavesdropping should it occur, and which give a guarantee of no eavesdropping.
Подобные документы
Classification of tools for the implementation of sensing systems. The necessity of application of sensing systems and some of their parameters are described, which are useful for robots with systems of artificial intelligence. Voxel or pixel graphics.
статья, добавлен 26.04.2021The nature and characteristics of distributed operating systems. Characteristic and distinctive features of operating systems real-time. Description, application and purpose multiprocessor operating systems, its role and place in computer security.
презентация, добавлен 25.09.2016- 53. Providing access to information systems of higher education in the case of loss of key information
Comparative analysis of the ways to reduce the contingency of loss of access. The secret key - the main part of the protection system in most cryptographic algorithms. Homomorphism property as one of the basic features of Shamir threshold scheme.
статья, добавлен 06.05.2018 Blind signature schemes as an important cryptographic primitive in protocols allowing to obtain a valid signature that guarantee the anonymity of the participants. Two new blind signature schemes based on the discrete logarithm problem are presented.
статья, добавлен 15.09.2012A flexible system troubleshooting and emergency operation of stepwise refinement priori probability. Ensuring reliability recognition of failure. Automatic search of breaks with step-by-step variations of parameters of tests in communication systems.
статья, добавлен 30.07.2016Random generators for cryptographic applications. Evaluation criteria for the principle design. Multiplication in binary extension fields. Time simulations and spectral algorithms. Limits on the maximum clock frequency of pipelined architectures.
учебное пособие, добавлен 08.03.2014The implementation of various pairings on a contemporary 32-bit smartcard, Philips HiPerSmart, an instantiation of the MIPS-32 based SmartMIPS architecture. Pairings as classic cryptographic primitives with a calculation time of as little as 0.15 sec.
статья, добавлен 15.09.2012Analysis of the features of teaching communication technologies, directions of application of information and communication technologies in the educational process, the purpose of modern technologies, the main advantages of the introduction of ICT.
статья, добавлен 22.07.2022The security challenges of ubiquitous computing. The study side channel attack methodology. Hardware to solve sparse systems of linear equations over. Symmetric ciphers: side channel attacks and countermeasures. Attacks on asymmetric cryptosystems.
курс лекций, добавлен 08.03.2014Сomputer facilities and microprocessor systems, data manipulation. The general principles of programming. The branched and cyclic programs organization using Assembler-86 language. X-bit Motorola microprocessors. Communication networks designing.
методичка, добавлен 11.10.2014New cryptosystems and optimizations. The security of all bits using list decoding. A lattice construction for partial key exposure attack for RSA. Controlling access to an oblivious database using stateful anonymous credentials. Identity-based encryption.
материалы конференции, добавлен 08.03.2014Implementing two-party computation efficiently with security against malicious adversaries. Two generic constructions of probabilistic cryptosystems and their applications. Cramer-shoup satisfies a stronger plaintext awareness under a weaker assumption.
книга, добавлен 08.03.2014The logic of authentication of Burrows, Abadi and Needham. which transforms a protocol into a special form and then uses logical rules to analyze it. Using BAN logic and its enhancements in order to find new weaknesses in various cryptographic protocols.
статья, добавлен 15.09.2012Computational and Mathematical Preliminaries: computability, complexity, intractability. Efficient Number-Theoretic Algorithms and Intractable Problems. Public-Key Cryptography and Type Crytposystems. Integer Factorization and Discrete Logarithm Attacks.
книга, добавлен 08.03.2014Characteristics of information and communication technologies. History of the creation of a computer system. Classification operating system: DOS, Windows, Unix, Linux, Mac OS. Databases management systems: the concept, characteristics, architecture.
курс лекций, добавлен 20.10.2016The first public key system - Diffie-Hellman key agreement. Solving discrete logarithm problem. Mutual identification with key establishment. Unicity distance for secret key cipher. Statistical tests for random and pseudo-random number generators.
книга, добавлен 08.03.2014Faster explicit formulas for computing pairings over ordinary curves. Secure authentication from a weak key, without leaking information. Towards a game theoretic view of secure computation. Concurrent composition in the bounded quantum storage model.
книга, добавлен 08.03.2014Analysis of the extended euclidean algorithm. Analysis of operations in the residue class ring. Structure of the multiplicative group of residues mod a prime number. Symmetric and asymmetric cryptosystems. Compression functions from encryption functions.
книга, добавлен 08.03.2014Автономная система обработки результатов работы исследовательского института "quantum computing". Автоматизированная система обработки данных Финляндского филиала Российской компании "Travelling Is Simple". Защита от утечек по техническим каналам.
курсовая работа, добавлен 24.03.2016A new general mathematical problem, suitable for public-key cryptosystems, is proposed: morphism computation in a category of Abelian groups. The problem seems to be hard for solving with a quantum computer. A demonstrative example of encryption.
статья, добавлен 15.09.2012A number of different techniques that people can use to hide information. The sound files and images that float about the network today. Measuring and encrypting information. Error correction and white noise. Analysis of hiding information in JPEG files.
книга, добавлен 08.03.2014A computational complexity based theory of modern encryption. Generating pseudo-random bit or number sequences. Generic encryption with pseudorandom functions. Problems with deterministic encryption in general. Required properties for digital cash.
книга, добавлен 08.03.2014One Useful Logic That Defines Its Own Truth. On Synchronous and Asynchronous Interaction in Distributed Systems. A Robust Class of Regular Languages. Deterministic Models of Communication Faults. The Maximum Independent Set Problem in Planar Graphs.
книга, добавлен 08.03.2014Study of issues of maximizing small root bounds by linearization and applications of subjects of small secret exponents in RSA. Secure network coding over the integers, and the CCA proxy re-encryption without bilinear maps in the standard model.
материалы конференции, добавлен 08.03.2014Protection from disclosure to unauthorised persons integrity. Maintaining data consistency. Assurance of identity of person or originator of data non-repudiation. Conventional encryption: uses a shared key. Digital Signatures and especially their use.
учебное пособие, добавлен 08.03.2014