Abstract
We combine the method of searching for an invariant subspace of the unbalanced Oil and Vinegar signature scheme and the Minrank method to defeat the new TTS signature scheme, which was suggested for low-cost smart card applications at CHES 2004. We show that the attack complexity is less than 250.
Original language | English |
---|---|
Pages (from-to) | 231-240 |
Number of pages | 10 |
Journal | International Journal of Information Security |
Volume | 5 |
Issue number | 4 |
DOIs | |
Publication status | Published - Oct 2006 |
Externally published | Yes |
Keywords
- Minrank
- Multivariate
- Public key
- Quadratic polynomials
- Tame transformation