Key space (cryptography)

Known as: Key space 
In cryptography, an algorithm's key space refers to the set of all possible permutations of a keys.
Wikipedia

Topic mentions per year

Topic mentions per year

1954-2017
05019542016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Access card authentication is critical and essential for many modern access control systems, which have been widely deployed in… (More)
  • figure 1
  • figure 4
  • figure 2
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The most basic functionality of a distributed hash table, or DHT, is to partition a key space across the set of nodes in a… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A Peerto-peer networked system is a collaborating group of Intemet nodes which overlay their own special-purpose network on top… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
One difficulty in the cryptanalysis of the Advanced Encryption Standard AES is the tension between operations in the two fields… (More)
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Status of this Memo This memo provides information for the Internet community. It does not specify an Internet standard of any… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Hash-based scalable distributed data structures (SDDSs), like LH* and DDH, for networks of intcmonnected ampllters… (More)
  • figure 1
  • figure 3
  • table 1
  • figure 5
  • table 3
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The Time-Split B-tree is an integrated index structure for a versioned timestamped database. It gradually migrates data from a… (More)
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Given a set S of n distinct ke~s from a key space M = {l,2, ..• ,m}, a basic information retrieval problem is to store S so that… (More)
  • figure 3
Is this relevant?
Highly Cited
1977
Highly Cited
1977
We present a new data structure for maintaining a set of records in a linear list according to their key values. This data… (More)
  • figure 2.1
  • figure 2.4
  • figure 2.2
  • figure 4
Is this relevant?
Highly Cited
1973
Highly Cited
1973
The problem of searching the set of keys in a file to find a key which is closest to a given query key is discussed. After… (More)
  • figure 1
  • table I
  • table II
  • table III
Is this relevant?