|
|||||
|
|
Cryptanalysis of dragon scheme |
|
| Authors: | YUAN Feng HU Yu-pu WANG Yan OU Hai-wen |
| Affiliation: | 1. Key Laboratory of Computer Networks and Information Security, Ministry of Education, Xidian University, Xi''an 710071, China;2. School of Science, Xi''an University of Architecture and Technology, Xi''an 710055, China;3. Key Laboratory of Information Security, Beijing Electronic Science and Technology Institute, Beijing 100070, China |
| Abstract: | Patarin proposed the dragon scheme,pointed out the insecurity of the dragon algorithm with one hidden monomial and suggested a candidate dragon signature algorithm with a complicated function.This paper presents an algebraic method to attack the candidate dragon signature algorithm.The attack borrows the basic idea of the attack due to Kipnis and Shamir,and utilizes the underlying algebraic structure of the candidate dragon signature algorithm over the extension field to derive a way to enable the variable Y be viewed as a fixed value.The attack recovers the private keys efficiently when the parameters are n≤25 and D=「logqd」≤3. |
| Keywords: | cryptography public key cryptography polynomials mapping multivariate dragon scheme algebraic method cryptanalysis |
| 本文献已被 维普 万方数据 ScienceDirect 等数据库收录！ | |