Geometric ideas for cryptographic equation solving in even characteristic

Murphy, S. and Paterson, Maura B. (2009) Geometric ideas for cryptographic equation solving in even characteristic. In: Parker, M.G. (ed.) Cryptography and Coding. Lecture Notes in Computer Science 5921. Berlin, Germany: Springer, pp. 202-221. ISBN 9783642108679.

Abstract

The GeometricXL algorithm is a geometrically invariant version of the XL algorithm that uses polynomials of a much smaller degree than either a standard Groebner basis algorithm or an XL algorithm for certain multivariate equation systems. However, the GeometricXL algorithm as originally described is not well-suited to fields of even characteristic. This paper discusses adaptations of the GeometricXL algorithm to even characteristic, in which the solution to a multivariate system is found by finding a matrix of low rank in the linear span of a collection of matrices. These adaptations of the GeometricXL algorithm, termed the EGHAM process, also use polynomials of a much smaller degree than a Groebner basis or an XL algorithm for certain equation systems. Furthermore, the paper gives a criterion which generally makes a Groebner basis or standard XL algorithm more efficient in many cryptographic situations.

Metadata

Statistics

Downloads

Export as XMLJSONCSV

Activity Overview

2Downloads

173Hits

Additional statistics are available via IRStats2.

Archive Staff Only (login required)

Edit/View Item