Cryptography Dr. Bhavani Thuraisingham The University of Texas at Dallas (UTD) June 2012
Domain Agenda • • • Definitions History Goals and Process Certificate Authority Key Management Initialization Vector Symmetric Key Cryptography Asymmetric Key Cryptography Substitution Ciphers Message Authentication Code Steganography and Watermarking Cryptanalysis and attacks
Definitions • Cryptography – Mathematical manipulation of information that prevents the information being disclosed or altered • Cryptanalysis – Defeating the protected mechanisms of cryptography • Cryptology – Study of Cryptography and Cryptanalysis
Domain Agenda • • • Definitions History Goals and Process Certificate Authority Key Management Initialization Vector Symmetric Key Cryptography Asymmetric Key Cryptography Substitution Ciphers Message Authentication Code Steganography and Watermarking Cryptanalysis and attacks
Historical Development of Cryptography • Cryptographic Techniques – – – Manual Mechanical Electro-mechanical Electronic Quantum Cryptography
Basic Goals of Cryptography • • • Confidentiality Integrity Authenticity Non-repudiation Access control Make compromise difficult
Making Secure Cryptographic Algorithms • Problems – Discernible – Redundancies – Statistical Patterns • Solutions – Confusion – Diffusion – Avalanche
Basic Transformation Techniques • • Substitution Transposition or permutation Compression Expansion Padding Key mixing Initialization vector (IV)
Process • • • Input (also called Plaintext or Clear Text) Cryptosystem (device that performs encryption/decryption) Cryptographic Algorithms (Mathematical functions) Output (Cipher text or Cryptogram) Key (Crypto variable)
Work Factor • Work Factor is defined as the amount of effort (usually measured in units of time) needed to break a cryptosystem. • The Work Factor of a cryptosystem is related to its key-length and the working mechanism used (encryption and decryption algorithms). For example, if the brute force attack method is used to break the system (trying all possible combinations of the key), then the work factor is directly proportional to the length of the key. For every addition of one bit to the key length, the time needed (work factor) is doubled.
Domain Agenda • • • Definitions History Goals and Process Certificate Authority Key Management Initialization Vector Symmetric Key Cryptography Asymmetric Key Cryptography Substitution Ciphers Message Authentication Code Steganography and Watermarking Cryptanalysis and attacks
Certificate Authority (CA) • Manages certificate lifecycle • Trusted third party • Registration authority
Certificate Authority • In cryptography, a certificate authority or certification authority (CA) is an entity that issues digital certificates for use by other parties. It is an example of a trusted third party. CAs are characteristic of many public key infrastructure (PKI) schemes. • Commercial CAs charge to issue certificates that will automatically be trusted by most web browsers (Mozilla maintains a list of at least 36 trusted root CAs, though multiple commercial CAs or their resellers may share the same trusted root ). • The number of web browsers and other devices and applications that trust a particular certificate authority is referred to as ubiquity. • Aside from commercial CAs, some providers issue digital certificates to the public at no cost. Large institutions or government entities may have their own CAs.
Certificate Authority • Certificate-based encryption is a system in which a certificate authority uses IDbased cryptography to produce a certificate. This system gives the users both implicit and explicit certification, the certificate can be used as a conventional certificate (for signatures, etc. ), but also implicitly for the purpose of encryption. • A user Alice can doubly encrypt a message using another user's (Bob) public key and his (Bob's) identity. • This means that the user (Bob) cannot decrypt it without a currently valid certificate and also that the certificate authority cannot decrypt the message as they don't have the user's private key (i. e. , there is no implicit escrow as with ID -based cryptography, as the double encryption means they cannot decrypt it solely with the information they have).
Domain Agenda • • • Definitions History Goals and Process Certificate Authority Key Management Initialization Vector Symmetric Key Cryptography Asymmetric Key Cryptography Substitution Ciphers Message Authentication Code Steganography and Watermarking Cryptanalysis and attacks
Key Management • Key management is the provisions made in a cryptography system design that are related to generation, exchange, storage, safeguarding, use, vetting, and replacement of keys. It includes cryptographic protocol design, key servers, user procedures, and other relevant protocols. • Key management concerns keys at the user level, either between users or systems. This is in contrast to key scheduling; key scheduling typically refers to the internal handling of key material within the operation of a cipher. • Successful key management is critical to the security of a cryptosystem. In practice it is arguably the most difficult aspect of cryptography because it involves system policy, user training, organizational and departmental interactions, and coordination between all of these elements.
Key Clustering • In cryptography, key clustering is said to occur when two different keys generate the same ciphertext from the same plaintext, using the same cipher algorithm. A good cipher algorithm, using different keys on the same plaintext, should generate a different ciphertext, irrespective of the key length. • If an 'attacker' tries to break a cipher by brute-force (trying all possible keys until it finds the correct key) then key clustering will result in an easier attack on a particular cipher text. If there are N possible keys without any key clustering then the attacker will on average need to try N/2 keys to decrypt it and a worst case of trying all N keys. If there are two keys that are clustered, then the average number of keys to try is reduced to N/4 (worst case is N-1 keys). If three keys cluster then average attempt is only N/6 attempts.
Functions of Key Management • Operations – Dual control – Split knowledge • Creation – Automated key generation – Truly random – Key encrypting keys • Change – Expiry
Functions of Key Management • Distribution – – Out of band Public key encryption Key distribution center Certificates • Storage – Trusted hardware – Smartcard • Recovery – Key escrow – Multi-party key recovery
Domain Agenda • • • Definitions History Goals and Process Certificate Authority Key Management Initialization Vector Symmetric Key Cryptography Asymmetric Key Cryptography Substitution Ciphers Message Authentication Code Steganography and Watermarking Cryptanalysis and attacks
Initialization Vector • In cryptography, an initialization vector (IV) is a block of bits that is required to allow a stream cipher or a block cipher to be executed in any of several modes of operation to produce a unique stream independent from other streams produced by the same encryption key, without having to go through a (usually lengthy) re-keying process. • The size of the IV depends on the encryption algorithm and on the cryptographic protocol in use and is normally as large as the block size of the cipher or as large as the encryption key. • The IV must be known to the recipient of the encrypted information to be able to decrypt it.
Initialization Vector • This can be ensured in a number of ways: by transmitting the IV along with the cipher text, by agreeing on it beforehand during the key exchange or the handshake, by calculating it (usually incrementally), or by measuring such parameters as current time (used in hardware authentication tokens such as RSA Secur. ID) IDs such as sender's and/or recipient's address or ID, file ID, the packet, sector or cluster number, etc. • A number of variables can be combined or hashed together, depending on the protocol. If the IV is chosen at random, the cryptographer must take into consideration the probability of collisions, and if an incremental IV is used as a nonce, the algorithm's resistance to related-IV attacks must also be considered. • Nonce – number used once
Domain Agenda • • • Definitions History Goals and Process Certificate Authority Key Management Initialization Vector Symmetric Key Cryptography Asymmetric Key Cryptography Substitution Ciphers Message Authentication Code Steganography and Watermarking Cryptanalysis and attacks
Symmetric Key Cryptography • Symmetric-key algorithms are a class of algorithms for cryptography that use trivially related, often identical, cryptographic keys for both decryption and encryption. • The encryption key is trivially related to the decryption key, in that they may be identical or there is a simple transformation to go between the two keys. The keys, in practice, represent a shared secret between two or more parties that can be used to maintain a private information link. • The disadvantage of symmetric cryptography is that it presumes two parties have agreed on a key and been able to exchange that key in a secure manner prior to communication. This is a significant challenge. Symmetric algorithms are usually mixed with public key algorithms to obtain a blend of security and speed.
Block Cipher • Fixed-sized blocks – Plaintext blocks are encrypted into blocks of ciphertext • Some modes provide integrity by being sensitive to small changes/errors • Uses – Data transport – Data storage
Block Cipher • • • In cryptography, a block cipher is a symmetric key cipher operating on fixed-length groups of bits, called blocks, with an unvarying transformation. A block cipher encryption algorithm might take (for example) a 128 -bit block of plaintext as input, and output a corresponding 128 -bit block of ciphertext. The exact transformation is controlled using a second input — the secret key. Decryption is similar: the decryption algorithm takes, in this example, a 128 -bit block of ciphertext together with the secret key, and yields the original 128 -bit block of plaintext. To encrypt messages longer than the block size (128 bits in the above example), a mode of operation is used. Block ciphers can be contrasted with stream ciphers; a stream cipher operates on individual digits one at a time, and the transformation varies during the encryption. The distinction between the two types is not always clear-cut: a block cipher, when used in certain modes of operation, acts effectively as a stream cipher. An early and highly influential block cipher design was the Data Encryption Standard (DES), developed at IBM and published as a standard in 1977. A successor to DES, the Advanced Encryption Standard (AES), was adopted in 2001.
Modes of Symmetric Block Ciphers • Block Modes – Electronic Code Book (ECB) – Cipher Block Chaining (CBC) • Stream Modes – Cipher Feed Back (CFB) – Output Feed Back (OFB) – Counter (CTR) • New Modes
Example Techniques • Electronic Code Book – Each block of plaintext is encrypted independently using the same key. • Cipher Block Chaining (CBC) – The first plaintext block is XOR’ed with an Initialization Vector (IV) – Resulting ciphertext result is chained into the next plaintext block • Cipher Feed Back (CFB) – Similar to CBC – IV is encrypted and then XOR’ed with the first plaintext block • Output Feed Back (OFB) – Operates very much like CFB – Only the RESULT of encrypting the IV is fed back to the next operation
Example Techniques • Counter (CTR) – Similar to OFB – A counter value is used instead of an IV • Counter with CBC-MAC (CCM) – Provides confidentiality and authenticity – Works with 128 bit block size – Not for stream mode
DES • Double DES (DDES) • Triple DES (TDES) – DES-EEE 3 or 3 TDES-EEE – DES-EDE 3 or 3 TDES-EDE – DESo-EEE 2 (2 TDES-EEE), DES-EDE 2 (2 TEDS-EDE
AES (Rijndael) • • Developed by Daemen and Rijmen in 1998 Block sizes: 128, 192, 256 Variable number of rounds Variable key size
Other Block Ciphers • • • RC 5 & RC 6 Blowfish Twofish CAST SAFER Serpent
Stream Cipher • • • In cryptography, a stream cipher is a symmetric key cipher where plaintext bits are combined with a pseudorandom cipher bit stream (, (keystreams) typically by an exclusive-or (XOR) operation. In a stream cipher the plaintext digits are encrypted one at a time, and the transformation of successive digits varies during the encryption. An alternative name is a state cipher, as the encryption of each digit is dependent on the current state. In practice, the digits are typically single bits or bytes. Stream ciphers represent a different approach to symmetric encryption from block ciphers. Block ciphers operate on large blocks of digits with a fixed, unvarying transformation. This distinction is not always clear-cut: in some modes of operation, a block cipher primitive is used in such a way that it acts effectively as a stream cipher. Stream ciphers typically execute at a higher speed than block ciphers and have lower hardware complexity. However, stream ciphers can be susceptible to serious security problems if used incorrectly: see stream cipher attacks — in particular, the same starting state must never be used twice.
Strengths & Weaknesses of Symmetric -Key Cryptography Strengths Fast Difficult to crack Algorithms and tools freely available Stream ciphers highly-efficient serial comms • Block ciphers offer multiple modes • • Weaknesses • Key negotiation / exchange / distribution • Poor scalability • Limited security
Domain Agenda • • • Definitions History Goals and Process Certificate Authority Key Management Initialization Vector Symmetric Key Cryptography Asymmetric Key Cryptography Substitution Ciphers Message Authentication Code Steganography and Watermarking Cryptanalysis and attacks
Asymmetric Key Cryptography • Diffie and Hellman, 1976 • Public key cryptography • Uses a pair of mathematically related-keys – Private key – Public key
Algorithms • RSA: Rivest-Shamir-Adleman, 1977 – Encryption – Digital Signatures – Adjustable key size • • • Diffie-Hellman Key Exchange Protocol Elgamal Elliptic Curve Cryptography (ECC) Merkle-Hellman Knapsack Chor-Rivest Knapsack
Digital Signatures • • • (Asymmetric cryptography) + (Hash of message) Only authenticity and non-repudiation (not confidentiality) Sender’s private key encrypts the hash Sender’ public key used to verify signature Legality Examples – DSA, RSA, Elgamal, Schnorr, ECC
Digital Signature Uses • • Non-repudiation of origin Integrity of message Software distribution Email and secure document distribution
Digital Signature • A digital signature or digital signature scheme is a mathematical scheme for demonstrating the authenticity of a digital message or document. A valid digital signature gives a recipient reason to believe that the message was created by a known sender, and that it was not altered in transit. Digital signatures are commonly used for software distribution, financial transactions, and in other cases where it is important to detect forgery and tampering. • Digital signatures are often used to implement electronic signatures, a broader term that refers to any electronic data that carries the intent of a signature, but not all electronic signatures use digital signatures. [In some countries, including the United States, India, and members of the European Union, electronic signatures have legal significance. However, laws concerning electronic signatures do not always make clear whether they are digital cryptographic signatures in the sense used here, leaving the legal definition, and so their importance, somewhat confused.
Digital Signature • Digital signatures employ a type of asymmetric cryptography. For messages sent through an insecure channel, a properly implemented digital signature gives the receiver reason to believe the message was sent by the claimed sender. Digital signatures are equivalent to traditional handwritten signatures in many respects; properly implemented digital signatures are more difficult to forge than the handwritten type. Digital signature schemes in the sense used here are cryptographically based, and must be implemented properly to be effective. • Digital signatures can also provide non-repudiation, meaning that the signer cannot successfully claim they did not sign a message, while also claiming their private key remains secret; further, some non-repudiation schemes offer a time stamp for the digital signature, so that even if the private key is exposed, the signature is valid nonetheless. Digitally signed messages may be anything representable as a bitstring: examples include electronic mail, contracts, or a message sent via some other cryptographic protocol.
Public Key Infrastructure (PKI) • • • Binds a person/entity to their public keys Public keys are published and are certified by digital signatures Cross-certification Certificate Revocation Lists (CRL’s) X 509 standard
Public Key Cryptography • Public-key cryptography is a cryptographic approach which involves the use of asymmetric key algorithms instead of or in addition to symmetric key algorithms. • Unlike symmetric key algorithms, it does not require a secure initial exchange of one or more secret keys to both sender and receiver. • The asymmetric key algorithms are used to create a mathematically related key pair: a secret private key and a published public key. Use of these keys allows protection of the authenticity of a message by creating a digital signature of a message using the private key, which can be verified using the public key. • It also allows protection of the confidentiality and integrity of a message, by public key encryption, encrypting the message using the public key, which can only be decrypted using the private key.
Public Key Cryptography • Public key cryptography is a fundamental and widely used technology around the world. It is the approach which is employed by many cryptographic algorithms and cryptosystems. It underlies such Internet standards as Transport Layer Security (TLS) (successor to SSL), PGP, and GPG. • Uses asymmetric key algorithms, where the key used to encrypt a message is not the same as the key used to decrypt it. Each user has a pair of cryptographic keys—a public key and a private key. The private key is kept secret, whilst the public key may be widely distributed. Messages are encrypted with the recipient's public key and can only be decrypted with the corresponding private key. The keys are related mathematically, but the private key cannot be feasibly derived from the public key.
Public Key Infrastructure • Public Key Infrastructure (PKI) is a set of hardware, software, people, policies, and procedures needed to create, manage, distribute, use, store, and revoke digital certificates]. In cryptography, a PKI is an arrangement that binds public keys with respective user identities by means of a certificate authority (CA). The user identity must be unique within each CA domain. The binding is established through the registration and issuance process, which, depending on the level of assurance the binding has, may be carried out by software at a CA, or under human supervision. The PKI role that assures this binding is called the Registration Authority (RA). For each user, the user identity, the public key, their binding, validity conditions and other attributes are made unforgeable in public key certificates issued by the CA. • The term trusted third party (TTP) may also be used for certificate authority (CA). The term PKI is sometimes erroneously used to denote public key algorithms, which do not require the use of a CA
Strong Cryptographic Solutions for PKI • • • Use evaluated solutions High work factor Publicly-evaluated cryptographic algorithms Training Law enforcement issues
Web of Trust • An alternative approach to the problem of public authentication of public key information is the web of trust scheme, which uses self-signed certificates and third party attestations of those certificates. The singular term Web of Trust does not imply the existence of a single web of trust, or common point of trust, but rather any number of potentially disjoint "webs of trust". Examples of implementations of this approach are PGP (Pretty Good Privacy) • Because PGP and implementations allow the use of e-mail digital signatures for self-publication of public key information, it is relatively easy to implement one's own Web of Trust. One of the benefits of the Web of Trust, such as in PGP, is that it can interoperate with a PKI CA fully-trusted by all parties in a domain (such as an internal CA in a company) that is willing to guarantee certificates, as a trusted introducer.
Asymmetric Key Cryptography • • • Strengths Confidentiality Access Control Authentication Integrity Non-repudiation Weaknesses • Computationally intensive • Very slow
Domain Agenda • • • Definitions History Goals and Process Certificate Authority Key Management Initialization Vector Symmetric Key Cryptography Asymmetric Key Cryptography Substitution Ciphers Message Authentication Code Steganography and Watermarking Cryptanalysis and attacks
Substitution Ciphers • In cryptography, a substitution cipher is a method of encryption by which units of plaintext are replaced with cipher text according to a regular system; the "units" may be single letters (the most common), pairs of letters, triplets of letters, mixtures of the above, and so forth. The receiver deciphers the text by performing an inverse substitution. • Substitution ciphers can be compared with transposition ciphers. In a transposition cipher, the units of the plaintext are rearranged in a different and usually quite complex order, but the units themselves are left unchanged. By contrast, in a substitution cipher, the units of the plaintext are retained in the same sequence in the ciphertext, but the units themselves are altered.
Substitution Ciphers • There a number of different types of substitution cipher. If the cipher operates on single letters, it is termed a simple substitution cipher; a cipher that operates on larger groups of letters is termed polygraphic. A monoalphabetic cipher uses fixed substitution over the entire message, whereas a polyalphabetic cipher uses a number of substitutions at different times in the message, where a unit from the plaintext is mapped to one of several possibilities in the ciphertext and vice-versa. • Substitution over a single letter—simple substitution—can be demonstrated by writing out the alphabet in some order to represent the substitution. This is termed a substitution alphabet. The cipher alphabet may be shifted or reversed (e. g. , Caesar ) or scrambled in a more complex fashion, in which case it is called a mixed alphabet.
Simple Substitution Cipers • Substitute of one value for another – Shift Alphabet (by 3) • ABCDEF. . FACE • DEFGHI. . . IDFH – Scramble Alphabet • ABCDEF. . FACE • QEYRTM. . . MQYT
Simple Transposition/ Permutation Ciphers • Rearranging the message – Plaintext (This is an example of transposition) – Cipher “tsaoni hamfst inptpi selroo lexeasn” • Key: Grid shape and reading direction • Example: the Spartan Skytale T H I S A N E X A M P L E O F T R A N S P O S I T I O N
Polyalphabetic Ciphers • Substitution cipher using multiple alphabets A B C D E F G H I J K L M N O P Q R S T U V W X Y 1 Z A B C D E F G H I J K L M N O P Q R S T U V W X Y 2 Y Z A B C D E F G H I J K L M N O P Q R S T U V W X 3 X Y Z A B C D E F G H I J K L M N O P Q R S T U V W 4 W X Y Z A B C D E F G H I J K L M N O P Q R S T U V - • Ecrypt the plaintext ‘FEEDBACK’ using a key of 3241
Running Key Ciphers • Use of the value of letters and a shared book – Key: ‘On a non interfering basis over…’ – Message: ‘This material is enciphered’ A B C D E F G H I J K L M N O P Q R S T U V W Z Y Z 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
One-Time Pads (OTP) • • Truly random key values Both sides have same pad of key values Keys are only used once Unbreakable algorithm
Message Integrity Controls (MIC) • Detection of alterations • Value added to message • One-way functions
Domain Agenda • • • Definitions History Goals and Process Certificate Authority Key Management Initialization Vector Symmetric Key Cryptography Asymmetric Key Cryptography Substitution Ciphers Message Authentication Code Steganography and Watermarking Cryptanalysis and attacks
Message Authentication Codes • In cryptography, a message authentication code (often MAC) is a short piece of information used to authenticate a message. • A MAC algorithm, sometimes called a keyed (cryptographic) hash function, accepts as input a secret key and an arbitrary-length message to be authenticated, and outputs a MAC (sometimes known as a tag). The MAC value protects both a message's data integrity as well as its authenticity, by allowing verifiers (who also possess the secret key) to detect any changes to the message content.
Checksum • A checksum or hash sum is a fixed-size datum computed from an arbitrary block of digital data for the purpose of detecting accidental errors that may have been introduced during its transmission or storage. • The integrity of the data can be checked at any later time by recomputing the checksum and comparing it with the stored one. If the checksums do not match, the data was almost certainly altered (either intentionally or unintentionally). • The procedure that yields the checksum from the data is called a checksum function or checksum algorithm. A good checksum algorithm will yield a different result with high probability when the data is accidentally corrupted; if the checksums match, the data is very likely to be free of accidental errors.
Hash Function • A hash function is any well-defined procedure or mathematical function that converts a large, possibly variable-sized amount of data into a small datum, usually a single integer that may serve as an index to an array. The values returned by a hash function are called hash values, hash codes, hash sums, checksums or simply hashes. • A hash function may map two or more keys to the same hash value. In many applications, it is desirable to minimize the occurrence of such collisions, which means that the hash function must map the keys to the hash values as evenly as possible.
Common Hash Functions • Message digest – MD 2, MD 4, MDS • Secure Hash Algorithm (SHA) – SHA – 1 ( 160), SHA – 256, SHA – 384 – SHA – 512 (Best Practice) • • HAVAL RIPEMD Tiger WHIRLPOOL
Hash Functions Characteristics • • Condensed representation of the message One-way function Non-linear relationship Hash calculated from whole, original message
Domain Agenda • • • Definitions History Goals and Process Certificate Authority Key Management Initialization Vector Symmetric Key Cryptography Asymmetric Key Cryptography Substitution Ciphers Message Authentication Code Steganography and Watermarking Cryptanalysis and attacks
Steganography • • Art of hiding information Plaintext hidden/disguised Prevents a third party from knowing that a secret message exists Traditionally accomplished in a number of ways: – Physical techniques – Null ciphers
Steganography • Steganography is the art and science of writing hidden messages in such a way that no one, apart from the sender and intended recipient, suspects the existence of the message, a form of security through obscurity. • Generally, messages will appear to be something else: images, articles, shopping lists, or some other covertext and, classically, the hidden message may be in invisible ink between the visible lines of a private letter. • The advantage of steganography, over cryptography alone, is that messages do not attract attention to themselves. • Cryptography protects the contents of a message, steganography can be said to protect both messages and communicating parties.
Steganography • Steganography includes the concealment of information within computer files. • In digital steganography, electronic communications may include steganographic coding inside of a transport layer, such as a document file, image file, program or protocol. • Media files are ideal for steganographic transmission because of their large size. • As a simple example, a sender might start with an innocuous image file and adjust the color of every 100 th pixel to correspond to a letter in the alphabet, a change so subtle that someone not specifically looking for it is unlikely to notice it.
Digital Watermarking • Digital watermarking is the process of embedding information into a digital signal in a way that is difficult to remove. The signal may be audio, pictures or video, for example. If the signal is copied, then the information is also carried in the copy. A signal may carry several different watermarks at the same time. • In visible watermarking, the information is visible in the picture or video. Typically, the information is text or a logo which identifies the owner of the media. The image on the right has a visible watermark. When a television broadcaster adds its logo to the corner of transmitted video, this is also a visible watermark. • In invisible watermarking, information is added as digital data to audio, picture or video, but it cannot be perceived as such (although it may be possible to detect that some amount of information is hidden).
Digital Watermarking • The watermark may be intended for widespread use and is thus made easy to retrieve or it may be a form of Steganography, where a party communicates a secret message embedded in the digital signal. In either case, as in visible watermarking, the objective is to attach ownership or other descriptive information to the signal in a way that is difficult to remove. It is also possible to use hidden embedded information as a means of covert communication between individuals. • One application of watermarking is in copyright protection systems, which are intended to prevent or deter unauthorized copying of digital media. In this use a copy device retrieves the watermark from the signal before making a copy; the device makes a decision to copy or not depending on the contents of the watermark. Another application is in source tracing. A watermark is embedded into a digital signal at each point of distribution. If a copy of the work is found later, then the watermark can be retrieved from the copy and
Domain Agenda • • • Definitions History Goals and Process Certificate Authority Key Management Initialization Vector Symmetric Key Cryptography Asymmetric Key Cryptography Substitution Ciphers Message Authentication Code Steganography and Watermarking Cryptanalysis and Attacks
Attacks • • Brute Force Birthday Dictionary Known Plaintext Chosen Plaintext Cipher text Only Chosen Cipher text
Cryptanalysis • Art and Science of Breaking Codes • Attack Vectors – – – Key Algorithm Implementation Data (ciphertext or plaintext) People – social engineering • Assumptions
Brute Force • Trying all possible key combinations • Two factors: cost and time – Moore’s Law – Measured in MIPS per year Bits Number of Keys Brute Force Attack Time 56 7. 2 x 1016 20 hours 80 1. 2 x 1024 54, 800 years 128 3. 4 x 1038 1. 5 x 1019 years 256 1. 15 x 1077 5. 2 x 1057 years
Plaintext Attacks • Known plaintext attacks • Chosen plaintext attack • Adaptive chosen plaintext attach
Ciphertext Attacks • Ciphertext only • Chosen ciphertext attack • Adaptive chosen ciphertext attack
Attacks Against Ciphers • Stream – Frequency analysis – IV or keystream analysis • Block – – – Linear cryptanalysis Differential cryptanalysis Linear-differential cryptananlysis Algebraic attacks Frequency analysis
Attacks Against Hash Functions • Dictionary attacks – Based on known lists of common words • Birthday attacks – Attack the hash value – Attack the initialization vector • Rainbow table attacks – Hash reductions – Salts
Other Common Attacks • Meet-in-the-middle • Man-in-the-middle • Poor random number generation
Скачать презентацию Cryptography Dr Bhavani Thuraisingham The University of Texas
3e7e2ad2c7cf0cc7fa9792a315b6973f.ppt