Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/2272Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Sarkar, Palash | - |
| dc.date.accessioned | 2011-08-04T08:01:53Z | - |
| dc.date.available | 2011-08-04T08:01:53Z | - |
| dc.date.issued | 2007 | - |
| dc.identifier.citation | Discrete applied mathematics,V155,2,P2174-2180 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10263/2272 | - |
| dc.language.iso | en | en_US |
| dc.subject | Cryptographic hash function | en_US |
| dc.subject | UOWHF | en_US |
| dc.subject | Binary tree | en_US |
| dc.subject | Parallel computation | en_US |
| dc.title | Construction of universal one way hash functions : tree hashing revisited | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | Mathematics and Statistics | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Binder2.pdf | 1.24 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.