Efficiently Checking Separating Indeterminates
Bernhard Andraschko, Martin Kreuzer, Le Ngoc Long

TL;DR
This paper develops fast algorithms for verifying specific variable elimination conditions in polynomial ideals, enhancing techniques for algebraic elimination and cryptanalysis of AES variants.
Contribution
It introduces efficient algorithms to check for $Z$-separating re-embeddings, improving the process of polynomial ideal elimination and cryptanalysis.
Findings
Algorithms effectively verify $Z$-separating tuples in polynomial ideals.
Extended methods apply to Boolean polynomials in cryptanalysis.
Applied to faster cryptanalysis of reduced AES versions.
Abstract
In this paper we continue the development of a new technique for computing elimination ideals by substitution which has been called -separating re-embeddings. Given an ideal in the polynomial ring over a field , this method searches for tuples of indeterminates with the property that contains polynomials of the form for such that no term in is divisible by an indeterminate in . As there are frequently many candidate tuples , the task addressed by this paper is to efficiently check whether a given tuple has this property. We construct fast algorithms which check whether the vector space spanned by the generators of or a somewhat enlarged vector space contain the desired polynomials . We also extend these algorithms to Boolean polynomials and apply them to cryptoanalyse round…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · semigroups and automata theory · Algorithms and Data Compression
