Hash Functions and Gröbner Bases Cryptanalysis
Explore this paper's citation graph
Summary
Hash functions are being used as building blocks in such diverse primitives as commitment schemes, message authentication codes and digital signatures.
- Type
- dissertation
- Published
- 2012-01-01
- Cited by
- 1
- References
- 253
- Access
- Open access
- OpenAlex
- https://openalex.org/W13970004
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:42281389
Keywords
Hash function, Cryptanalysis, SHA-2, Computer science, Cryptographic hash function
References
- Integrity Primitives for Secure Information Systems: Final RIPE Report of RACE Integrity Primitives Evaluation
- An Algebraic Cryptanalysis of Nonlinear Filter Generators using Gröbner bases
- The Skein Hash Function Family
- Algebraic Immunities of functions over finite fields
- Edon-R, An Infinite Family of Cryptographic Hash Functions
- Étude des systèmes algébriques surdéterminés. Applications aux codes correcteurs et à la cryptographie
- The MD4 Message Digest Algorithm (Abstract)
- SHA-3 proposal BLAKE
- Multivariate quadratic trapdoor functions based on multivariate quadratic quasigroups
- An Introduction to Quasigroups and Their Representations
- Handbook of Discrete and Combinatorial Mathematics
- The Code Book: The Evolution of Secrecy from Mary, Queen of Scots, to Quantum Cryptography
- A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications
- Secret sharing schemes arising from latin squares
- An Algorithmic Method in Polynomial Ideal Theory
- On a Family of Minimal Candidate One-way Functions and One-way Permutations
- l-Invertible Cycles for Multivariate Quadratic (MQ) Public Key Cryptography
- Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'98
- A Construction of Public Key Cryptosystem for Realizing Ciphertext of Size 100 Bit and Digital Signature Scheme
- Basic Abstract Algebra