Weil sum for birthday attack in multivariate quadratic cryptosystem
From MaRDI portal
Publication:5443564
DOI10.1515/JMC.2007.006zbMath1211.94030WikidataQ122415656 ScholiaQ122415656MaRDI QIDQ5443564
Donald K. Friesen, Tomohiro Harayama
Publication date: 21 February 2008
Published in: Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc.2007.006
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
11T24: Other character sums and Gauss sums
Uses Software
Cites Work
- Parallel collision search with cryptanalytic applications
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Planes of order \(n\) with collineation groups of order \(n^ 2\)
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Evaluation of some exponential sums over a finite field
- A public key system with signature and master key functions
- A Fast and Secure Implementation of Sflash
- On the Security of HFE, HFEv- and Quartz
- On the evaluation of Weil sums of Dembowski-Ostrom polynomials