(1) IAKS, Arbeitsgruppe Systemsicherheit, Prof. Dr. Th. Beth, Fakultät für Informatik, Universität Karlsruhe, Am Fasanengarten 5, 76131 Karlsruhe, Germany;(2) Fachhochschule Aargau, Klosterzelgstrasse, 5210 Windisch, Switzerland
Abstract:
As a possible new mathematical basis for authentication and signature schemes, at EUROCRYPT 96 J. Patarin introduced the isomorphisms of polynomials (IP) problem [4, 5]. In this contribution, we describe an attack on the secret key of IP with one secret and demonstrate its efficiency through examples with realistic parameter sizes. The attack is carried out by means of a computer algebra system on ordinary PCs. Finally, we give a brief discussion of limits of our attack that points out possible directions for solving the mentioned security problems.
96 J. Patarin introduced the isomorphisms of polynomials (IP) problem [4, 5]. In this contribution, we describe an attack on the secret key of IP with one secret and demonstrate its efficiency through examples with realistic parameter sizes. The attack is carried out by means of a computer algebra system on 
ordinary PCs
. Finally, we give a brief discussion of limits of our attack that points out possible directions for solving the mentioned security problems.