Live briefing
Everything about LSH (hash function)
Cryptographic hash function
LSH is a cryptographic hash function designed in 2014 by South Korea to provide integrity in general-purpose software environments such as PCs and smart devices. LSH is one of the cryptographic algorithms approved by the Korean Cryptographic Module Validation Program (KCMVP). And it is the national standard of South Korea. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: LSH (hash function)A 5-minute orientation
- Read the landmark paper: A Parallel Quantum Circuit Implementations of LSH Hash Function for Use with Grover’s AlgorithmCited 6 times
- Go sideways: LPBoostA closely related topic
- Go sideways: Multilinear formA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
📚 Books worth reading
Open Library didn't respond; try again in a moment.
🔗 Related topics
- LPBoost Linear Programming Boosting (LPBoost) is a supervised classifier from the boosting family of classifiers. LPBoost maximizes a margin between training samples…
- Multilinear form In abstract algebra and multilinear algebra, a multilinear form on a vector space V {\displaystyle V} over a field K {\displaystyle K} is a map f : V k…
- Dynamic epistemic logic Dynamic epistemic logic (DEL) is a logical framework dealing with knowledge and information change. Typically, DEL focuses on situations involving multiple…
- Jensen hierarchy In set theory, a mathematical discipline, the Jensen hierarchy or J-hierarchy is a modification of Gödel's constructible hierarchy, L, that circumvents…
- Martingale (probability theory) In probability theory, a martingale is a stochastic process in which the expected value of the next observation, given all prior observations, is equal…
- ACE Encrypt ACE (advanced cryptographic engine) is the collection of units, implementing both a public key encryption scheme and a digital signature scheme. Corresponding…
- Grzegorczyk hierarchy The Grzegorczyk hierarchy (/ɡrɛˈɡɔːrtʃək/, Polish pronunciation: [ɡʐɛˈɡɔrt͡ʂɨk]), named after the Polish logician Andrzej Grzegorczyk, is a hierarchy of…
- Rademacher complexity In computational learning theory (machine learning and theory of computation), Rademacher complexity, named after Hans Rademacher, measures richness of…