Tiger (cryptography)

Known as: Tiger hash, Tiger hash function, Tiger (disambiguation) 
In cryptography, Tiger is a cryptographic hash function designed by Ross Anderson and Eli Biham in 1995 for efficiency on 64-bit platforms. The size… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2006-2018
012320062018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Secure multicast routing is an important in mobile healthcare system. Few research works have been developed to prevent malicious… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2014
2014
Bloom is an efficient data structure technique. Initially it was used in intelligent dictionaries and spell check applications… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2012
2012
Tiger is an important type of an hash function producing 192-bit hash value from 512-bit message block and is proved to be secure… (More)
  • table I
  • figure 2
  • table II
  • table V
  • table III
Is this relevant?
2010
2010
This paper evaluates the preimage resistance of the Tiger hash function. We will propose a pseudo-preimage attack on its… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
2009
2009
Tiger is a cryptographic hash function proposed by Anderson and Biham in 1996 and produces a 192-bit hash value. Recently… (More)
  • table 1
  • figure 1
Is this relevant?
2007
2007
Tiger is a cryptographic hash function with a 192-bit hash value. It was proposed by Anderson and Biham in 1996. Recently… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
Is this relevant?
2007
2007
With the increasing prominence of the Internet as a tool of commerce, security has become a tremendously important issue. One… (More)
  • figure 1
  • figure 6
  • table 2
Is this relevant?
2006
2006
Tiger is a cryptographic hash function with a 192-bit hash value which was proposed by Anderson and Biham in 1996. At FSE 2006… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • table 3
Is this relevant?
2006
2006
We describe a collision-finding attack on 16 rounds of the Tiger hash function requiring the time for about 2 compression… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2006
2006
  • Guoping Wang
  • 2006 IEEE International Conference on Electro…
  • 2006
New hash function algorithms have a potential application compared to the conventional MD family hash functions. The architecture… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 3
Is this relevant?