A Bibliography of Publications on Hashing Algorithms - Index of files in

REFERENCES 243
[KVK12]
[KW94]
ISSN 0302-9743 (print), 1611-
3349 (electronic). URL
http://link.springer.com/
content/pdf/10.1007/978-3-
642-10366-7_37.
Kortelainen:2012:GIH
Tuomas Kortelainen, Ari Vesanen,
and Juha Kortelainen.
Generalized iterated hash functions
revisited: New complexity
bounds for multicollision attacks.
Lecture Notes in CS,
7668:172–190, 2012. CODEN
LNCSD9. ISSN 0302-9743
(print), 1611-3349 (electronic).
URL http://link.springer.
com/chapter/10.1007/978-3-
642-34931-7_11/.
Kroll:1994:DST
Brigitte Kröll and Peter Widmayer.
Distributing a search
tree among a growing number
<strong>of</strong> processors. SIGMOD Record
(ACM Special Interest Group
on Management <strong>of</strong> Data), 23
(2):265–276, June 1994. CO-
DEN SRECD8. ISSN 0163-5808
(print), 1943-5835 (electronic).
Klassen:2012:ITB
[KW12] Toryn Qwyllyn Klassen and
Philipp Woelfel. Independence
<strong>of</strong> tabulation-based hash
classes. Lecture Notes in
CS, 7256:506–517, 2012. CO-
DEN LNCSD9. ISSN 0302-
9743 (print), 1611-3349 (electronic).
URL http://link.
springer.com/content/pdf/
10.1007/978-3-642-29344-3_
43.
Kaps:2005:ESU
[KYS05] J.-P. Kaps, K. Yuksel, and
B. Sunar. Energy scalable universal
hashing. IEEE Transactions
on Computers, 54(12):
1484–1495, December 2005.
CODEN ITCOB4. ISSN
0018-9340 (print), 1557-9956
(electronic). URL http://
ieeexplore.ieee.org/stamp/
stamp.jsp?tp=&arnumber=1524931.
Kjellberg:1984:CH
[KZ84] Peter Kjellberg and Torben U.
Zahle. Cascade hashing. In
VLDB, pages 481–492. VLDB
Endowment, Saratoga, CA,
USA, August 1984.
Lai:1992:DSB
[Lai92] Xuejia Lai. On the design
and security <strong>of</strong> block ciphers.
Hartung-Gorre Verlag, Konstanz,
Switzerland, 1992. ISBN
3-89191-573-X. xii + 108 pp.
LCCN ??? This is the author’s
Ph.D. dissertation. “Secret-key
block ciphers are the subject
<strong>of</strong> this work. The design and
security <strong>of</strong> block ciphers, together
with their application
in hashing techniques, are considered.
In particular, iterated
block ciphers that are based on
iterating a weak round function
several times are considered.
Four basic constructions
for the round function <strong>of</strong> an iterated
cipher are studied.”.
LakshmanYN:1996:IPI
[Lak96] Lakshman Y. N., editor. IS-
SAC ’96: Proceedings <strong>of</strong> the