Open AccessHidden Number Problem and Its Applications in Crypto Scheme
Author(s) -
YuYun Chen,
Jiongqi Wang,
Jun Xu
Publication year - 2017
Publication title -
destech transactions on engineering and technology research
Language(s) - English
Resource type - Journals
ISSN - 2475-885X
DOI - 10.12783/dtetr/sste2016/6491
Subject(s) - univariate , arithmetic function , modular design , scheme (mathematics) , mathematics , key (lock) , theoretical computer science , arithmetic , computer science , algorithm , algebra over a field , discrete mathematics , pure mathematics , statistics , programming language , multivariate statistics , mathematical analysis , computer security
This paper is based on the research result of Nguyen’s attacking against DSA .We extent the Hidden Number Method (HNM) from the univariate modular polynomials with one order to the univariate modular polynomials with higher order. There are many crypto schemes using the arithmetical and truncate operations. If the constant terms are partly known, these schemes can be written as the modular equations. We analysis a scheme using the arithmetical and truncate operations so as to improve the lattice model. On the supposed condition, we can recover the basic key with the probability 99%.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom