Cryptographic attacks

Acoustic cryptanalysis is a side channel attack which exploits sounds, audible or not, produced during a computation or input-output operation. ...more on Wikipedia about "Acoustic cryptanalysis"

In cryptography, an adaptive chosen plaintext attack and chosen ciphertext attack is one in which the attacker can choose both plaintexts to be encrypted and ciphertexts to be decrypted, and can do so interactively, basing one query on the results of the previous. It combines the capabilities of an adaptive chosen plaintext and an adaptive chosen ciphertext attack. The scenario is one which presumes the greatest capabilites of an attacker, and so is the least likely to be feasible in practice. Two attacks of this type are the yoyo game and boomerang attacks on block ciphers. ...more on Wikipedia about "Adaptive chosen plaintext and chosen ciphertext attack"

An adaptive-chosen-ciphertext attack (abbreviated as CCA₂) is an interactive form of chosen-ciphertext attack in which an attacker sends a number of ciphertexts to be decrypted, then uses the results of these decryptions to select subsequent ciphertexts. It is to be distinguished from an indifferent-chosen-ciphertext attack (CCA₁). ...more on Wikipedia about "Adaptive chosen-ciphertext attack"

In cryptography, an adversary (rarely opponent, enemy) is a malicious entity whose aim is to prevent the users of the cryptosystem from achieving their goal (primarily privacy, integrity and availability of data). An adversary's efforts might take the form of attempting to discover secret data, corrupting some of the data in the system, spoofing the identity of a message sender or receiver, or forcing system downtime. ...more on Wikipedia about "Adversary"

Attack models specify how much information a cryptanalyst has access to when cracking an encrypted message. Some common attack models are: ...more on Wikipedia about "Attack model"

A birthday attack is a type of cryptographic attack which exploits the mathematics behind the birthday paradox, making use of a space-time tradeoff. Specifically, if a function yields any of $n$ different outputs with equal probability and $n$ is sufficiently large, then after evaluating the function for about $1.2 \sqrt n$ different arguments we expect to have found a pair of different arguments $x_1$ and $x_2$ with $f(x_1) = f(x_2)$ , known as a collision. If the outputs of the function are distributed unevenly, then a collision can be found even faster (Bellare and Kohno, 2004). ...more on Wikipedia about "Birthday attack"

A bit-flipping attack is an attack on a cryptographic cipher in which the attacker can change the ciphertext in such as a way as to result in a predictable change of the plaintext, although the attacker is not able to learn the plaintext itself. Note that this type of attack is not -- directly -- against the cipher itself (as cryptanalysis of it would be), but against a particular message or series of them. In the extreme, this could become a Denial of service attack against all messages on a particular channel using that cipher. ...more on Wikipedia about "Bit-flipping attack"

A Black Bag Job or Black Bag Operation is a covert entry action undertaken by a police force or intelligence agency. A black bag job should not become known to its target, so violence or confrontation are to be avoided. ...more on Wikipedia about "Black bag job"

In cryptography, the boomerang attack is a method for the cryptanalysis of block ciphers based on differential cryptanalysis. The attack was published in 1999 by David Wagner. ...more on Wikipedia about "Boomerang attack"

In cryptanalysis, a brute force attack is a method of defeating a cryptographic scheme by trying a large number of possibilities; for example, exhaustively working through all possible keys in order to decrypt a message. In most schemes, the theoretical possibility of a brute force attack is recognised, but it is set up in such a way that it would be computationally infeasible to carry out. Accordingly, one definition of "breaking" a cryptographic scheme is to find a method faster than a brute force attack. ...more on Wikipedia about "Brute force attack"

A chosen-ciphertext attack (CCA) is an attack model for cryptanalysis in which the cryptanalyst chooses a ciphertext and causes it to be decrypted with an unknown key. Specific forms of this attack are sometimes termed "lunchtime" or "midnight" attacks, referring to a scenario in which an attacker gains access to an unattended decryption machine. A device which provides decryptions of chosen ciphertexts (either by accident or by design) is generically referred to as a "decryption oracle". ...more on Wikipedia about "Chosen-ciphertext attack"

A chosen plaintext attack (CPA) is an attack model for cryptanalysis which presumes that the attacker has the capability to choose arbitrary plaintexts to be encrypted and obtain the corresponding ciphertexts. The goal of the attack is to gain some further information which reduces the security of the encryption scheme. In the worst case, a chosen plaintext attack could reveal the scheme's secret key. ...more on Wikipedia about "Chosen-plaintext attack"

In cryptography, a ciphertext-only attack (COA) is an attack model for cryptanalysis where the attacker is assumed to have access only to a set of ciphertexts. ...more on Wikipedia about "Ciphertext-only attack"

A collision attack on a cryptographic hash tries to find two different inputs that will produce the same hash value, i.e. a hash collision. Unlike a hash collision, a collision attack normally aims to find an alternate input that still makes sense, rather than a just a nonsense input. ...more on Wikipedia about "Collision attack" This text is made for shortopedia shortopedia

Computer forensics is the process of investigating data storage devices and/or data processing equipment typically a home computer, laptop, server, office workstation, or removable media such as compact discs, to determine if the equipment has been used for illegal, unauthorized, or unusual activities. It can also include monitoring a network for the same purpose. Computer forensics experts must: ...more on Wikipedia about "Computer forensics"

===Case 1: Unauthorized Access at North Bay=== ...more on Wikipedia about "Computer fraud case studies"

In cryptanalysis, a crib is a sample of known plaintext; the term originated at Bletchley Park, the British codebreaking operation during World War II (WWII). ...more on Wikipedia about "Crib (cryptanalysis)"

Cryptanalysis (from the Greek kryptós, "hidden", and analýein, "to loosen" or "to untie") is the study of methods for obtaining the meaning of encrypted information, without access to the secret information which is normally required to do so. Typically, this involves finding the secret key. In non-technical language, this is the practice of codebreaking or cracking the code, although these phrases also have a specialised technical meaning (see code). ...more on Wikipedia about "Cryptanalysis"

Cryptanalytic computers were designed to be used for cryptanalysis. ...more on Wikipedia about "Cryptanalytic computer"

In cryptography, a custom hardware attack uses specially designed electronic circuits to decipher encrypted messages. ...more on Wikipedia about "Custom hardware attack"

In cryptanalysis and computer security, a dictionary attack is a technique for defeating a cipher or authentication mechanism by trying to determine its decryption key or passphrase by searching a large number of possibilities. In contrast with a brute force attack, where all possibilities are searched through exhaustively, a dictionary attack only tries possibilities which are most likely to succeed, typically derived from a list of words in a dictionary. Generally, dictionary attacks succeed because most people have a tendency to choose passwords which are easy to remember, and typically choose words taken from their native language. ...more on Wikipedia about "Dictionary attack"

shortopedia, the smart choice. shortopedia

Differential cryptanalysis is a general form of cryptanalysis applicable primarily to block ciphers, but also to stream ciphers and cryptographic hash functions. In the broadest sense, it is the study of how differences in an input can affect the resultant difference at the output. In the case of a block cipher, it refers to a set of techniques for tracing differences through the network of transformations, discovering where the cipher exhibits non- random behaviour, and exploiting such properties to recover the secret key. ...more on Wikipedia about "Differential cryptanalysis"

Differential power analysis (DPA) is a method of attacking a cryptosystem which exploits the varying power consumption of microprocessors while executing cryptographic program code. It is a side-channel attack. Using statistical analysis of the power consumption measurements of many runs of a given cryptographic algorithm, it may be possible to infer information on a secret key stored on a smart card, if the implementation of the algorithm is not DPA tamper proof. ...more on Wikipedia about "Differential power analysis"

Introduced by Martin Hellman and Susan K. Langford in 1994, the differential-linear attack is a mix of both linear cryptanalysis and differential cryptanalysis. ...more on Wikipedia about "Differential-linear attack"

distributed.net (or Distributed Computing Technologies, Inc. or DCTI) is a world-wide distributed computing effort that is attempting to solve large scale problems using otherwise idle CPU time. It is officially recognized as a non-profit organization under U.S. tax code 501(c)(3). ...more on Wikipedia about "Distributed.net"

This article is licensed under the GNU Free Documentation License.
It uses material from the Wikipedia . Direct links to the original articles are in the text.
If you use exact copy or modified of this article you should preserve above paragraph and put also : It uses material from the Shortopedia article about "Cryptographic attacks".

MAIN PAGE MAIN INDEX CONTACT US