Ciphertext-only attack

Known as: COA, Known-ciphertext, Ciphertext only attack 
In cryptography, a ciphertext-only attack (COA) or known ciphertext attack is an attack model for cryptanalysis where the attacker is assumed to have… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2018
05101519772018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Polly Two is a public key encryption scheme that builds on the conceptual public key encryption scheme Polly Cracker. We describe… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Recently, at Crypto 2008, Boneh, Halevi, Hamburg, and Ostrovsky (BHHO) solved the longstanding open problem of “circular… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
In this paper we present a very practical ciphertext-only cryptanalysis of GSM (Global System for Mobile communications… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
RC4 is the most widely deployed stream cipher in software applications. In this paper we describe a major statistical weakness in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2000
2000
At the SAC'96 the iterated block cipher, Akelarre, was proposed. Akelarre uses components of the block ciphers RC5 and IDEA and… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
1998
1998
We present a method for efficient conversion of differential (chosen plaintext) attacks into the more practical known plaintext… (More)
  • table 1
  • figure 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
This paper introduces a new adaptive chosen ciphertext attack against certain protocols based on RSA. We show that an RSA private… (More)
  • figure 1
  • figure 2
Is this relevant?
1998
1998
We present a method for eecient conversion of diierential (chosen-plaintext) attacks into the more practical known-plaintext and… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
By carefully measuring the amount of time required to perform private key operations, attackers may be able to nd xed Di eHellman… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Pseudonoise sequences generated by linear feedback shift registers [1] with some nonlinear combining function have been proposed… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?