On the Weil Sum Evaluation of Central Polynomial in Multivariate Quadratic Cryptosystem
نویسنده
چکیده
Abstract. A parity checking-styled Weil sum algorithm is presented for a general class of the univariate polynomials which fully characterize a system of n polynomials in n variables over F2. The previously known proof methods of explicit Weil sum evaluation of Dembowski-Ostrom polynomials are extended to general case. The algorithm computes the absolute values of the Weil sums of the generic central polynomials in MQ problem.
منابع مشابه
EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملMQ Challenge: Hardness Evaluation of Solving Multivariate Quadratic Problems
Multivariate Quadratic polynomial (MQ) problem serve as the basis of security for potentially post-quantum cryptosystems. The hardness of solving MQ problem depends on a number of parameters, most importantly the number of variables and the degree of the polynomials, as well as the number of equations, the size of the base field etc. We investigate the relation among these parameters and the ha...
متن کاملA Cryptanalysis of the Double-Round Quadratic Cryptosystem
In the 80’s Matsumoto and Imai [8] proposed public key cryptosystems based on the difficulty of solving systems of polynomials in several variables. Although these first schemes were broken, many others followed, leading to a very active field known as Multivariate cryptography. In this paper, we show how to break one of these schemes, the Double-Round Quadratic cryptosystem from [12]. We stres...
متن کاملAlgebraic Attack on the MQQ Public Key Cryptosystem
In this paper, we present an efficient attack on the multivariate Quadratic Quasigroups (MQQ) public key cryptosystem. Our cryptanalysis breaks the MQQ cryptosystem by solving a system of multivariate quadratic polynomial equations using both the MutantXL algorithm and the F4 algorithm. We present the experimental results that show that MQQ systems is broken up to size n equal to 300. Based on ...
متن کاملAttacks to polynomial cryptosystems
In this paper we review some possible attacks to cryptosystems based on the problem of multivariate quadratic equations (MQ). After introducing the MQ problem and sketching schemes to generate private and public keys for these cryptosystems, we present well-known attacks based attacks based on the Gröbner bases computation to solve multivariate systems. The MQ problem The MQ problem consists in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2006 شماره
صفحات -
تاریخ انتشار 2006