Tiger
From CryptoLounge
Contents |
Algorithm Type: Hash Function
- Designers: Eli Biham, Ross Anderson
- Published in: 1996
- Standards:
- Cryptanalysis status: not yet broken (note: this may be out of date. please see papers section to see how up to date the entries are)
Sizes
Links
Papers About This Algorithm
| Title | Published in | Proposed | Defined | Analyzed | Wounded | Broken |
|---|---|---|---|---|---|---|
| Tiger: A Fast New Hash Function | 1996 | Tiger | Tiger | |||
| Collisions and Near-Collisions for Reduced-Round Tiger | 2006 | Tiger | ||||
| Update on Tiger | 2006 | Tiger |
Facts about Tiger — Click + to find similar pages.RDF feed
| Relations to other articles | |
|---|---|
| Algorithm type | Hash Function + |
| Attribute values | |
| Digest length | 24 byte (192 bit) + |
| Block size | 64 byte (512 bit) + |
| Max final block size | 55 byte (440 bit) + |
| State size | 24 byte (192 bit) + |
| Home page | http://www.cs.technion.ac.il/~biham/Reports/Tiger/ + |
| Wikipedia entry | http://en.wikipedia.org/wiki/Tiger + |
