Tootfinder

Privacy-Preserving Anonymization of System and Network Event Logs Using Salt-Based Hashing and Temporal Noise
Shreyas Bargale, Akshit Vakati Venkata, Jaimandeep Singh, Chester Rebeiro
https://arxiv.org/abs/2507.21904

Privacy-Preserving Anonymization of System and Network Event Logs Using Salt-Based Hashing and Temporal Noise
System and network event logs are essential for security analytics, threat detection, and operational monitoring. However, these logs often contain Personally Identifiable Information (PII), raising significant privacy concerns when shared or analyzed. A key challenge in log anonymization is balancing privacy protection with the retention of sufficient structure for meaningful analysis. Overly aggressive anonymization can destroy contextual integrity, while weak techniques risk re-identificatio…

Spotlight Attention: Towards Efficient LLM Generation via Non-linear Hashing-based KV Cache Retrieval
Wenhao Li, Yuxin Zhang, Gen Luo, Haiyuan Wan, Ziyang Gong, Fei Chao, Rongrong Ji
https://arxiv.org/abs/2508.19740

Spotlight Attention: Towards Efficient LLM Generation via Non-linear Hashing-based KV Cache Retrieval
Reducing the key-value (KV) cache burden in Large Language Models (LLMs) significantly accelerates inference. Dynamically selecting critical KV caches during decoding helps maintain performance. Existing methods use random linear hashing to identify important tokens, but this approach is inefficient due to the orthogonal distribution of queries and keys within two narrow cones in LLMs. We introduce Spotlight Attention, a novel method that employs non-linear hashing functions to optimize the emb…

Contrastive Multi-View Graph Hashing
Yang Xu, Zuliang Yang, Kai Ming Ting
https://arxiv.org/abs/2508.12377 https://arxiv.org/pdf/2508.12377

Contrastive Multi-View Graph Hashing
Multi-view graph data, which both captures node attributes and rich relational information from diverse sources, is becoming increasingly prevalent in various domains. The effective and efficient retrieval of such data is an important task. Although multi-view hashing techniques have offered a paradigm for fusing diverse information into compact binary codes, they typically assume attributes-based inputs per view. This makes them unsuitable for multi-view graph data, where effectively encoding …

A blunt question: Which hashing algorithm do you prefer to use or even another unpopular algorithm? 🤔
I would be grateful for sharing the toot.
(we just discuss it without argument)
#hash #code #sha

@… at https://cryptpad.fr/login/ I get the error described at

Efficient Algorithms for Quantum Hashing
Ilnar Zinnatullin, Kamil Khadiev
https://arxiv.org/abs/2507.07002 https://arxiv.org/pdf/2507…

Efficient Algorithms for Quantum Hashing
Quantum hashing is a useful technique that allows us to construct memory-efficient algorithms and secure quantum protocols. First, we present a circuit that implements the phase form of quantum hashing using $2^{n-1}$ CNOT gates, where n is the number of control qubits. Our method outperforms existing approaches and reduces the circuit depth. Second, we propose an algorithm that provides a trade-off between the number of CNOT gates (and consequently, the circuit depth) and the precision of rota…

Hashing for Fast Pattern Set Selection
Maiju Karjalainen, Pauli Miettinen
https://arxiv.org/abs/2507.08745 https://arxiv.org/pdf/2507…

Hashing for Fast Pattern Set Selection
Pattern set mining, which is the task of finding a good set of patterns instead of all patterns, is a fundamental problem in data mining. Many different definitions of what constitutes a good set have been proposed in recent years. In this paper, we consider the reconstruction error as a proxy measure for the goodness of the set, and concentrate on the adjacent problem of how to find a good set efficiently. We propose a method based on bottom-k hashing for efficiently selecting the set and exte…

KEENHash: Hashing Programs into Function-Aware Embeddings for Large-Scale Binary Code Similarity Analysis
Zhijie Liu, Qiyi Tang, Sen Nie, Shi Wu, Liang Feng Zhang, Yutian Tang
https://arxiv.org/abs/2506.11612

KEENHash: Hashing Programs into Function-Aware Embeddings for Large-Scale Binary Code Similarity Analysis
Binary code similarity analysis (BCSA) is a crucial research area in many fields such as cybersecurity. Specifically, function-level diffing tools are the most widely used in BCSA: they perform function matching one by one for evaluating the similarity between binary programs. However, such methods need a high time complexity, making them unscalable in large-scale scenarios (e.g., 1/n-to-n search). Towards effective and efficient program-level BCSA, we propose KEENHash, a novel hashing approach…

Quantum Error Correction Exploiting Degeneracy to Approach the Hashing Bound
Kenta Kasai
https://arxiv.org/abs/2506.15636 https://arx…

Quantum Error Correction Exploiting Degeneracy to Approach the Hashing Bound
Quantum error correction is essential for realizing scalable quantum computation. Among various approaches, low-density parity-check codes over higher-order Galois fields have shown promising performance due to their structured sparsity and compatibility with iterative decoding algorithms whose computational complexity scales linearly with the number of physical qubits. In this work, we demonstrate that explicitly exploiting the degeneracy of quantum errors can significantly enhance the decodin…

Modern Minimal Perfect Hashing: A Survey
Hans-Peter Lehmann, Thomas Mueller, Rasmus Pagh, Giulio Ermanno Pibiri, Peter Sanders, Sebastiano Vigna, Stefan Walzer
https://arxiv.org/abs/2506.06536

Modern Minimal Perfect Hashing: A Survey
Given a set $S$ of $n$ keys, a perfect hash function for $S$ maps the keys in $S$ to the first $m \geq n$ integers without collisions. It may return an arbitrary result for any key not in $S$ and is called minimal if $m = n$. The most important parameters are its space consumption, construction time, and query time. Years of research now enable modern perfect hash functions to be extremely fast to query, very space-efficient, and scale to billions of keys. Different approaches give different tr…

NIST is done standardizing #ASCON, an encryption and hashing algorithm. I count that as a big win for #IoT security, in particular because the last review round's raised concerns were heeded and there is now a 32-bit tag mode usable for applications such as 802.15.4 link-layer security.
Congratulations…

NIST Finalizes ‘Lightweight Cryptography’ Standard to Protect Small Devices
Four related algorithms are now ready for use to protect data created and transmitted by the Internet of Things and other electronics

This https://arxiv.org/abs/2405.04406 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Rényi divergence guarantees for hashing with linear codes
We consider the problem of distilling uniform random bits from an unknown source with a given $p$-entropy using linear hashing. As our main result, we estimate the expected $p$-divergence from the uniform distribution over the ensemble of random linear codes for all integer $p\ge 2$. The proof relies on analyzing how additive noise, determined by a random element of the code from the ensemble, acts on the source distribution. This action leads to the transformation of the source distribution in…

Replaced article(s) found for cs.PF. https://arxiv.org/list/cs.PF/new
[1/1]:
- PHast -- Perfect Hashing with fast evaluation
Piotr Beling, Peter Sanders

Succinct Oblivious Tensor Evaluation and Applications: Adaptively-Secure Laconic Function Evaluation and Trapdoor Hashing for All Circuits
Damiano Abram, Giulio Malavolta, Lawrence Roy
https://arxiv.org/abs/2508.09673

Succinct Oblivious Tensor Evaluation and Applications: Adaptively-Secure Laconic Function Evaluation and Trapdoor Hashing for All Circuits
We propose the notion of succinct oblivious tensor evaluation (OTE), where two parties compute an additive secret sharing of a tensor product of two vectors $\mathbf{x} \otimes \mathbf{y}$, exchanging two simultaneous messages. Crucially, the size of both messages and of the CRS is independent of the dimension of $\mathbf{x}$. We present a construction of OTE with optimal complexity from the standard learning with errors (LWE) problem. Then we show how this new technical tool enables a host o…

SMT-Sweep: Word-Level Representation Unification for Hardware Verification
Ziyi Yang, Guangyu Hu, Mingkai Miao, Changyuan Yu, Hongce Zhang
https://arxiv.org/abs/2507.02008

SMT-Sweep: Word-Level Representation Unification for Hardware Verification
SAT sweeping has long been a cornerstone technique in logic simplification and equivalence checking at the bit level, leveraging structural hashing, simulation and SAT solving to prune redundant logic. However, with the growing adoption of word-level constructs in hardware verification, such as bit-vector operations, arithmetics and arrays, there lacks a counterpart of SAT sweeping at the word level. In this paper, we introduce SMT-Sweep, a novel extension of SAT sweeping into the word level, g…

This https://arxiv.org/abs/2505.16133 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIR_…

HASH-RAG: Bridging Deep Hashing with Retriever for Efficient, Fine Retrieval and Augmented Generation
Retrieval-Augmented Generation (RAG) encounters efficiency challenges when scaling to massive knowledge bases while preserving contextual relevance. We propose Hash-RAG, a framework that integrates deep hashing techniques with systematic optimizations to address these limitations. Our queries directly learn binary hash codes from knowledgebase code, eliminating intermediate feature extraction steps, and significantly reducing storage and computational overhead. Building upon this hash-based eff…

Protecting Small Organizations from AI Bots with Logrip: Hierarchical IP Hashing
Rama Carl Hoetzlein
https://arxiv.org/abs/2508.03130 https://arxiv.org/pdf…

Protecting Small Organizations from AI Bots with Logrip: Hierarchical IP Hashing
Small organizations, start ups, and self-hosted servers face increasing strain from automated web crawlers and AI bots, whose online presence has increased dramatically in the past few years. Modern bots evade traditional throttling and can degrade server performance through sheer volume even when they are well-behaved. We introduce a novel security approach that leverages data visualization and hierarchical IP hashing to analyze server event logs, distinguishing human users from automated enti…

Elementary Cellular Automata as Non-Cryptographic Hash Functions
Daniel McKinley
https://arxiv.org/abs/2506.06551 https://arxiv.org/p…

Elementary Cellular Automata as Non-Cryptographic Hash Functions
A subset of 10 of the 256 elementary cellular automata (ECA) are implemented as a hash function using an error minimization lossy compression algorithm operating on wrapped 4x4 neighborhood cells. All 256 rules are processed and 10 rules in two subsets of 8 are found to have properties that include both error minimization and maximization, unique solutions, a lossy inverse, efficient retroactive hashing, and an application to edge detection. The algorithm parallels the nested powers-of-two stru…

Vectorised Hashing Based on Bernstein-Rabin-Winograd Polynomials over Prime Order Fields
Kaushik Nath, Palash Sarkar
https://arxiv.org/abs/2507.06490 https…

Vectorised Hashing Based on Bernstein-Rabin-Winograd Polynomials over Prime Order Fields
We introduce the new AXU hash function decBRWHash, which is parameterised by the positive integer $c$ and is based on Bernstein-Rabin-Winograd (BRW) polynomials. Choosing $c>1$ gives a hash function which can be implemented using $c$-way single instruction multiple data (SIMD) instructions. We report a set of very comprehensive hand optimised assembly implementations of 4-decBRWHash using avx2 SIMD instructions available on modern Intel processors. For comparison, we also report similar careful…

Secure and practical Quantum Digital Signatures
Federico Grasselli, Gaetano Russo, Massimiliano Proietti
https://arxiv.org/abs/2508.05355 https://arxiv.org…

Secure and practical Quantum Digital Signatures
Digital signatures represent a crucial cryptographic asset that must be protected against quantum adversaries. Quantum Digital Signatures (QDS) can offer solutions that are information-theoretically (IT) secure and thus immune to quantum attacks. In this work, we analyze three existing practical QDS protocols based on preshared secure keys (e.g., established with quantum key distribution) and universal hashing families. For each protocol, we make amendments to close potential loopholes and prov…

This https://arxiv.org/abs/2501.16007 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCR_…

TOPLOC: A Locality Sensitive Hashing Scheme for Trustless Verifiable Inference
Large language models (LLMs) have proven to be very capable, but access to frontier models currently relies on inference providers. This introduces trust challenges: how can we be sure that the provider is using the model configuration they claim? We propose TOPLOC, a novel method for verifiable inference that addresses this problem. TOPLOC leverages a compact locality-sensitive hashing mechanism for intermediate activations, which can detect unauthorized modifications to models, prompts, or pr…