Block size (cryptography)

Known as: Block size 
In modern cryptography, symmetric key ciphers are generally divided into stream ciphers and block ciphers. Block ciphers operate on a fixed length… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1959-2017
010020019592017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
We present Path ORAM, an extremely simple Oblivious RAM protocol with a small amount of client storage. Partly due to its… (More)
  • table 1
  • table 2
  • figure 1
  • table 3
  • figure 3
Is this relevant?
Highly Cited
2011
Highly Cited
2011
In this paper, we propose a new lightweight block cipher called LBlock. Similar to many other lightweight block ciphers, the… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In this paper we propose a new family of very efficient hardware oriented block ciphers. The family contains six block ciphers… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We propose three indexing schemes for storing a set <italic>S</italic> of <italic>N</italic> points in the plane, each moving… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Quadrature amplitude modulation (QAM) schemes which vary the number of modulation levels in accordance with the mobile radio… (More)
  • figure I
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Blowfish, a new secret-key block cipher, is proposed. It is a Feistel network, iterating a simple encryption function 16 times… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Blocking is a well-known optimization technique for improving the effectiveness of memory hierarchies. Instead of operating on… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1985
Highly Cited
1985
We analyzed the UNIX 4.2 BSD file system by recording user-level activity in trace files and writing programs to analyze the… (More)
  • table IV
  • figure 1
  • figure 2
  • figure 1
  • figure 4
Is this relevant?
Highly Cited
1979
Highly Cited
1979
for the mean-square quantizing error where N is the. number of level&p(x) is the probability density of the input, and E’(x) is… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 3
  • table I
Is this relevant?