Abstract
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%.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: DEStech Transactions on Engineering and Technology Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
