Efficient Characteristic Set Algorithms for Equation Solving in Finite Fields and Applications in Cryptanalysis


Efficient characteristic set methods for computing solutions of polynomial equation systems in a finite field are proposed. The concept of proper triangular sets is introduced and an explicit formula for the number of solutions of a proper and monic (or regular) triangular set is given. An improved zero decomposition algorithm which can be used to reduce… (More)


6 Figures and Tables

Slides referencing similar topics