Hash function constructions from expander graphs
US7382876B2 · kind B2 · utility
31Cited by
4References
17Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Nov 1, 2005 |
| Grant date | Jun 3, 2008 |
| Priority date | — |
| Expiry date | May 3, 2026 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/9014
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Hash function constructions from expander graphs are described. In one aspect, an expander graph is walked to compute a hash function. The expander graph is walked using respective subsets of an input message. A label of a last vertex walked is an output of the hash function.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.