Abstract
The security of Digital Signature Algorithm is based on the proven hardness of the number theoretic problem of discrete logarithm. However, in practice, this public key based digital signature algorithm is prone to side channel based attacks. In this work, we consider the cryptanalysis of Digital Signature Algorithm, when partial information on ephemeral keys can be obtained. We present a variant of the existing lattice based cryptanalytic method for DSA and further extend our work by analysing the scenario when variable number of least significant bits per ephemeral keys are known for a set of signatures pertaining to a signatory.
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 callDisclaimer: 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.
