Amanote Research

Amanote Research

    RegisterSign In

Faster 64-Bit Universal Hashing Using Carry-Less Multiplications

Journal of Cryptographic Engineering - United States
doi 10.1007/s13389-015-0110-5
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer NetworksSoftwareCommunications
Date

September 4, 2015

Authors
Daniel LemireOwen Kaser
Publisher

Springer Science and Business Media LLC


Related search

Matching Multiplications in Bit-Vector Formulas

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Faster Hashing to ${\Mathbb G}_2$

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Universal Hashing and Multiple Authentication

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

On Risks of Using Cuckoo Hashing With Simple Universal Hash Classes

2009English

Synthesis of 64-Bit Triple Data Encryption Standard Algorithm Using VHDL

International Journal of Trend in Scientific Research and Development
2018English

Binary Robust Hashing Based on Probabilistic Bit Reliablity

2009English

ASIC Implementation of 32 and 64 Bit Floating Point ALU Using Pipelining

International Journal of Computer Applications
2014English

Telnet Encryption: DES 64 Bit Output Feedback

2000English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy