A trade-off between collision probability and key size in universal hashing using polynomials

ISSN： 0925-1022

Source： Designs, Codes and Cryptography, Vol.58, Iss.3, 2011-03, pp. : 271-278

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks

By Meyer auf der Heide F. Storch M. Wanka R.

Theory of Computing Systems, Vol. 30, Iss. 6, 1997-12 ,pp. : 627-644

Springer Publishing Company

Access to resources Recommend Favorite

Universal polynomials for singular curves on surfaces

Compositio Mathematica, Vol. 150, Iss. 7, 2014-07 ,pp. : 1169-1182

Cambridge University Press

Access to resources Recommend Favorite

Extinction Probability of Interacting Branching Collision Processes

Advances in Applied Probability, Vol. 44, Iss. 1, 2012-03 ,pp. : 226-259

Cambridge University Press

Access to resources Recommend Favorite

MRD Hashing

By Safavi-naini R. Charnes C.

Designs, Codes and Cryptography, Vol. 37, Iss. 2, 2005-11 ,pp. : 229-242

Springer Publishing Company

Access to resources Recommend Favorite

Universal PBW-Basis of Hall-Ringel Algebras and Hall Polynomials

By Guo J.Y. Fuller L.K.R.

Journal of Algebra, Vol. 198, Iss. 2, 1997-12 ,pp. : 339-351

Academic Press

Access to resources Recommend Favorite