Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Known-key distinguishing attack

Known as: Known key, Chosen key distinguisher, Chosen-key attack 
In cryptography, a known-key distinguishing attack is an attack model against symmetric ciphers, whereby an attacker who knows the key can find a… Expand
Wikipedia

Related topics

Related topics

12 relations
Attack modelBlock cipherBlock size (cryptography)Ciphertext indistinguishability
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Known-Key Distinguisher on Full PRESENT
In this article, we analyse the known-key security of the standardized PRESENT lightweight block cipher. Namely, we propose a… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations
In this paper, we improve the recent rebound and start-from-the-middle attacks on AES-like permutations. Our new cryptanalysis… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Breaking Grain-128 with Dynamic Cube Attacks
We present a new variant of cube attacks called a dynamic cube attack. Whereas standard cube attacks [4] find the key by solving… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Distinguisher and Related-Key Attack on the Full AES-256
In this paper we construct a chosen-key distinguisher and a related-key attack on the full 256-bit key AES. We define a notion of… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Breaking 104 Bit WEP in Less Than 60 Seconds
We demonstrate an active attack on the WEP protocol that is able to recover a 104-bit WEP key using less than 40,000 frames with… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
New types of cryptanalytic attacks using related keys
  • E. Biham
  • Journal of Cryptology
  • 2004
    • Corpus ID: 19776908
In this paper we study the influence of key-scheduling algorithms on the strength of blockciphers. We show that the key… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Lightweight Authentication Protocols for Low-Cost RFID Tags
Providing security in low-cost RFID tags is a challenging task because tags are highly resource constrained and cannot support… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A Provably Secure Additive and Multiplicative Privacy Homomorphism
Privacy homomorphisms (PHs) are encryption transformations mapping a set of operations on cleartext to another set of operations… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Secure Communication with a Publicly Known Key
We present a scheme for direct and confidential communication between Alice and Bob, where there is no need for establishing a… Expand
  • table 1
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract)
We prcscnt a general framework for constructing and analyzing authentication protocols in realistic models of communication… Expand
  • figure 1
  • figure 2
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE