Arish SateesanMaximizing Bloom Filter Efficiency on Hardware: Unleashing the Power of a Single Hash FunctionIn 1970, Howard Bloom presented space/time trade-offs for lookup algorithms in data structures based on hash coding with allowable errors…Aug 6, 2023Aug 6, 2023
Arish SateesanThe Birthday Paradox and Collisions in a Hash tableOpinions on probability vary among individuals; some embrace it, while others may not. Regardless, probability has the intriguing power to…Jul 29, 2022Jul 29, 2022
Arish SateesanWhat is Approximate Counting? Can approximate counting be efficient on hardware?Counters are an indispensable part of any statistical measurement. However, counting and storage can be a bit difficult when dealing with…Sep 7, 2021Sep 7, 2021
Arish SateesanAnalyze your hash functions: The Avalanche Metrics CalculationThe most desirable property of a block cipher or a cryptographic hash function is the Avalanche effect. Strict Avalanche Criterion is a…Jul 6, 2020Jul 6, 2020
