Basics of contemporary cryptography for IT practitioners
The 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.
Подобные документы
One of the basic primitives in cryptography and of computer science is a pseudo-random generator. The number of important applications, including the construction of a private provably secure key cryptosystem. The construct a pseudo-random generator.
статья, добавлен 15.09.2012A problem of binary pseudo random sequences creation of cryptographic security system for sequences of maximal length, with static characteristics. The questions of Galois and Fibonacci of creation primitive matrices random size over the simple field.
статья, добавлен 22.12.2016An Introduction to Cryptography: Simple substitution ciphers, Divisibility and Common Divisors. Discrete Logarithms and Diffie–Hellman. The index calculus and discrete logarithms. Combinatorics, Probability and Information Theory, Digital Signatures.
книга, добавлен 08.03.2014The Random Oracle Model and the Ideal Cipher Model Are Equivalent. Programmable Hash Functions and Their Applications. Adaptive One-Way Functions and Applications. Bits Security of the Elliptic Curve Diffie–Hellman Secret Keys. Cryptanalysis of MinRank.
книга, добавлен 08.03.2014An elementary technique which leads to a linear algorithm for solving the discrete logarithm problem on elliptic curves of trace one. Using elliptic curves in cryptography to eliminate curves whose group orders are equal to the order of the finite field.
статья, добавлен 15.09.2012Introduction to cryptography and data security. The study of random numbers and an unbreakable stream cipher. The data encryption standard and alternatives. Practical aspects of public-key cryptography. Principles of message authentication codes.
книга, добавлен 08.03.2014Tools for Security and Insecurity. Unbiasing a Biased Coin. Combining Weak Sources of Entropy. Pseudorandom Number Generators. Random Permutation Generation. Sound Approach to Random Number Generation and Use. Computationally Secure Information Stealing.
книга, добавлен 08.03.2014Computational 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.2014Block cipher modes of operation and data transformation for asymmetrical algorithms. Standardisation in cryptography. Trust models in public key cryptography. Cryptographic standards for the World Wide Web. People who play a role in cryptography.
книга, добавлен 08.03.2014Privacy and Authentication in program. The random Number Generation. Message-Authentication Code Algorithms. Encrypt and Authenticate Modes. Goals of Public Key Cryptography. The process optimize 32-Bit Implementation. Performance of the Small Variant.
книга, добавлен 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.2014The principle of quantum cryptography. Quantum no-cloning theorem. State detection and random number generator. Verify assumptions used in a security proof. Quantum hacking and countermeasures from this. Introduction of cryptography for engineers.
книга, добавлен 08.03.2014Basics of Contemporary Cryptography for Information Technology Practitioners. Codes for Error Detection. Advances in Coding Theory and Cryptography. Arcs, minihypers, and the classification of three-dimensional Griesmer codes. About the code equivalence.
книга, добавлен 08.03.2014Basics of Contemporary Cryptography. Codes for Error Detection. Advances in Coding Theory and Cryptography. Encryption Basics. Authentication Codes in the Query Model. Collision in the DSA Function. Fuzzy Identity-based Encryption: Efficient Schemes.
учебное пособие, добавлен 08.03.2014Factoring and discrete logarithm. One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval. Authenticate key exchange secure against dictionary attacks. Computing inverses over a shared secret modulus.
курс лекций, добавлен 08.03.2014Cryptography is the science of using mathematics to encrypt and decrypt data. PGP data compression routines, the random numbers used as session keys, the message digest. Compromised passphrase and private key. Protecting against bogus timestamps.
дипломная работа, добавлен 08.03.2014Bits and Bytes. Complementation or Bitwise NOT. Special Operations and Abbreviations. Booleans and BitFields. Conversion of Integral Types to Byte Arrays. Symmetric Block Ciphers. Rijndael and the Advanced Encryption Standard. Public Key Cryptography.
книга, добавлен 08.03.2014- 18. RSA Labs FAQ 4.0
Some of the more popular techniques in cryptography. The advantages and disadvantages of public-key cryptography compared with secret-key cryptography. Digital signature applications exportable from the United States. Proactive security techniques.
книга, добавлен 08.03.2014 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.2012Finding Small Solutions to Univariate and Bivariate Polynomial Congruences. The RSA Public Key Cryptosystem. Coppersmith Attack on Short Random Pads. Cryptanalysis via the Defining Equation. The Lattice Factoring Method. Improved Determinant Bounds.
диссертация, добавлен 08.03.2014The book is organized into three parts. The first part covers private-key cryptography. Chapters 4-9 concern the main topics in public-key cryptography. The remaining four chapters provide introductions to four active research areas in cryptography.
книга, добавлен 13.03.2014A wireless sensor network of distributed autonomous sensors to monitor physical or environmental conditions and to cooperatively pass their data through the network. The analysis of models of wireless sensor network with random access is presented.
статья, добавлен 26.08.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.2012Cryptography in the Information Age. Information Protection Problems in Computer Systems. The Fundamentals of One-Key Cryptography. Substituion—Permutation Networks with Minimal Controlled Elements. Designing Fast Ciphers Based on Controlled Operations.
книга, добавлен 08.03.2014A mixing core for block cipher cryptography. Measured Boolean function nonlinearity in variable size block ciphers. Orthogonal latin squares, nonlinear balanced block mixers, and mixing ciphers. Binomial and Poisson statistics functions in JavaScript.
книга, добавлен 08.03.2014