Unicity distance

Known as: Spurious key 
In cryptography, unicity distance is the length of an original ciphertext needed to break the cipher by reducing the number of possible spurious keys… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2016
012319792016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
A cryptographic scheme based on chaos with nice idea was proposed in 2006. After studying this scheme, we found that an important… (More)
Is this relevant?
2011
2011
Currently, the navigation and positioning services face some problems, such as specificiality, unicity, poor value-added services… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
2007
2007
An image hash is a randomized compact representation of image content and finds applications in image authentication, image and… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
This paper proposes a new method for calculating the missing elements of an incomplete matrix of pairwise comparison values for a… (More)
Is this relevant?
2005
2005
— Steganography is about how to send secret message covertly. And the purpose of steganalysis is to not only detect the existence… (More)
  • table II
  • figure 1
  • figure 2
  • table III
  • table IV
Is this relevant?
2005
2005
— Steganography is about how to send secret message covertly. And the purpose of steganalysis is to not only detect the existence… (More)
  • table II
  • figure 1
  • figure 2
  • table III
  • table IV
Is this relevant?
1999
1999
0. Introduction 1. Description of NTRU 1.1. Notation 1.2. Key Creation 1.3. Encryption 1.4. Decryption 1.5. Why Decryption Works… (More)
Is this relevant?
1996
1996
The unicity distance, U, of a secret-key cipher is defined by Shannon as the minimum amount of intercepted ciphertext symbols… (More)
  • figure 1
  • table 1
Is this relevant?
1994
1994
The aim of this paper is to present a signature scheme in which the ability to sign messages of a signer is limited to a fixed… (More)
Is this relevant?
1988
1988
In his landmark 1977 paper [2], Hellman extends the Shannon theory approach to cryptography [3]. In particular, he shows that the… (More)
Is this relevant?