Efficient universal hashing method

Details Efficient universal hashing method Efficient universal hashing method

2007-02-06

2007-02-06

Barrón, Jr., Gilberto (Department: 2132)

Cryptography

Particular algorithmic function encoding

C380S268000, C380S270000

Reexamination Certificate

active

09175178

ABSTRACT:
An efficient hashing technique usesw2+w2operations to hash a string “w” words long rather than the w2operations of the prior art. This efficiency is achieved by squaring the sum of the key and the string to be hashed rather than forming a product of the key and the string to be hashedin-line-formulae description="In-line Formulae" end="lead"?h(m)=((m+a)2modp)mod 21.in-line-formulae description="In-line Formulae" end="tail"?

REFERENCES:
patent: 5442699 (1995-08-01), Arnold et al.
patent: 5625693 (1997-04-01), Rohatgi et al.
patent: 6122375 (2000-09-01), Takaragi et al.
Scneier, Applied Cryptography, 1996, Wiley and Sons, 2nd edition, pp. 457, 458.
A.R. Meijer, Hash Functions Based on Modular Squaring, Transactions of the S.A. Institute of Electrical Engineers, Jun. 1995.
Bellare and Micciacio, Hashing by Adding, section 5, A New Paradigm for Collision Free Hashing: Incrementality at Reduced Cost, Nov. 1996, Advances in Cryptology, Eurocrypt 97 Proceedings.
Schneier, Bruce. “One Way Hash Functions.” Message Authentication Codes. New York, NY: John Wiley & Sons, Inc, 1996. 457-458.
EPO International Search Report, EP 99 30 8032, dated Mar. 29, 2004.
Etzel et al., “Square Hash: Fast Message Authentication Via Optimized Universal Hash Function,” XP-002271715, dated.
S. Halevi and H. Krawczyk, “MMH: Message Authentication I the Gbit/second Rates,” XP-002271714 in Proceedings of the 4thWorkshop on Fast Software Encryption, Lecture Notes in Computer Science, Springer-Verlag, Mar. 1997.
Jueneman et al., “Message Authentication,” IEEE Communications Magazine, Sep. 1985—vol. 23, No. 9, pp. 29-40.
Preneel et al., “Cryptographic Hash Functions,” European Transactions on Telecommunications and Related Technologies, XP 000460559, Jul. 1994.
Girault, Marc, “Hash-Functions Using Modulo-n Operations,” Advances in Cryptology, Eurocrypt '87, LNCS. 304, pp. 217-226, 1988.
Knuth, D.E.: “The Art of Computer Programming,” vol. 2: Seminumerical Algorithms 1980, Addison Wesley, Reading, Massachusetts, USA XP 002271716, 2ndEdition, pp. 10-11, & 26-27.

Affiliated with

Also associated with

Rating

Efficient universal hashing method does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient universal hashing method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient universal hashing method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3854913