Listing 1 - 5 of 5 |
Sort by
|
Choose an application
block cipher --- implementation --- symmetric cryptology --- stream cipher --- hash function --- cryptanalysis --- Cryptography --- Ciphers
Choose an application
This Recommendation defines a mode of operation, called Counter with Cipher Block Chaining-Message Authentication Code (CCM), for a symmetric key block cipher algorithm. CCM may be used to provide assurance of the confidentiality and the authenticity of computer data by combining the techniques of the Counter (CTR) mode and the Cipher Block Chaining-Message Authentication Code (CBC-MAC) algorithm.
Computer security --- Authentication --- Data encryption (Computer science) --- Standards --- Standards. --- Authenticated encryption --- Block cipher --- Confidentiality --- Cryptography --- Encryption --- Information security --- Message authentication code --- Mode of operation
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
The Mathematics of Secrets takes readers on a fascinating tour of the mathematics behind cryptography-the science of sending secret messages. Using a wide range of historical anecdotes and real-world examples, Joshua Holden shows how mathematical principles underpin the ways that different codes and ciphers work. He focuses on both code making and code breaking and discusses most of the ancient and modern ciphers that are currently known. He begins by looking at substitution ciphers, and then discusses how to introduce flexibility and additional notation. Holden goes on to explore polyalphabetic substitution ciphers, transposition ciphers, connections between ciphers and computer encryption, stream ciphers, public-key ciphers, and ciphers involving exponentiation. He concludes by looking at the future of ciphers and where cryptography might be headed. The Mathematics of Secrets reveals the mathematics working stealthily in the science of coded messages.A blog describing new developments and historical discoveries in cryptography related to the material in this book is accessible at http://press.princeton.edu/titles/10826.html.
Cryptography --- Ciphers. --- Computer security. --- Mathematics. --- Adaptive chosen-ciphertext attack. --- Advanced Encryption Standard. --- Affine cipher. --- Alice and Bob. --- Autokey cipher. --- Block cipher mode of operation. --- Block cipher. --- Block size (cryptography). --- Brute-force attack. --- Brute-force search. --- Caesar cipher. --- Calculation. --- Chosen-ciphertext attack. --- Chosen-plaintext attack. --- Cipher. --- Ciphertext-only attack. --- Ciphertext. --- Codebook. --- Communication Theory of Secrecy Systems. --- Computational problem. --- Confusion and diffusion. --- Correlation attack. --- Craig Gentry (computer scientist). --- Cryptanalysis. --- Cryptogram. --- Cryptographic engineering. --- Cryptographic hash function. --- Cryptography Research. --- Cryptography. --- Cryptosystem. --- Data Encryption Standard. --- Differential cryptanalysis. --- Diffie–Hellman key exchange. --- Discrete logarithm. --- Disquisitiones Arithmeticae. --- Dual EC DRBG. --- ElGamal encryption. --- Elliptic curve cryptography. --- Encryption. --- Enigma machine. --- Euler's theorem. --- Fast Software Encryption. --- Feistel cipher. --- Fermat's little theorem. --- Forward secrecy. --- Grover's algorithm. --- Hill cipher. --- Homomorphic encryption. --- Hyperelliptic curve cryptography. --- Information theory. --- Initialization vector. --- International Association for Cryptologic Research. --- Kerckhoffs's principle. --- Key (cryptography). --- Key schedule. --- Key size. --- Keystream. --- Known-plaintext attack. --- Lattice problem. --- Linear cryptanalysis. --- Logjam (computer security). --- Mathematical problem. --- Mathematician. --- Mental poker. --- Merkle's Puzzles. --- Monte Carlo algorithm. --- Multiple encryption. --- NSA Suite B Cryptography. --- Nonlinear feedback shift register. --- Number theory. --- Padding (cryptography). --- Permutation box. --- Permutation. --- Plaintext. --- Polyalphabetic cipher. --- Post-quantum cryptography. --- Precomputation. --- Probabilistic encryption. --- Product cipher. --- Public-key cryptography. --- Quantum algorithm. --- Quantum cryptography. --- Quantum key distribution. --- RSA (cryptosystem). --- RSA problem. --- Related-key attack. --- S-box. --- Security level. --- Shor's algorithm. --- Sign (mathematics). --- Spyware. --- Stream cipher. --- Substitution cipher. --- Symmetric-key algorithm. --- Transposition cipher. --- VIC cipher. --- Variable (computer science). --- Vigenère cipher. --- Vulnerability (computing).
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
Listing 1 - 5 of 5 |
Sort by
|