International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: On the Minimum Number of Multiplications Necessary for Universal Hash Functions

Authors:
Mridul Nandi
Download:
DOI: 10.1007/978-3-662-46706-0_25
URL: https://www.iacr.org/archive/fse2014/85400105/85400105.pdf
Search ePrint
Search Google
Conference: FSE 2014
BibTeX
@inproceedings{fse-2014-27555,
  title={On the Minimum Number of Multiplications Necessary for Universal Hash Functions},
  booktitle={FSE},
  publisher={Springer},
  pages={489-508},
  url={https://www.iacr.org/archive/fse2014/85400105/85400105.pdf},
  doi={10.1007/978-3-662-46706-0_25},
  author={Mridul Nandi},
  year=2014
}