New constructions of cryptographic pseudorandom functions
Pseudorandom functions (PRFs) are the building blocks of symmetric-key cryptography. Almost all central goals of symmetric cryptography (e.g., encryption, authentication, identification) have simple solutions that make efficient use of a PRF. Most existing constructions of these objects are either (...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
Georgia Institute of Technology
2015
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/53916 |