Abstract

Several cryptosystems based on Elliptic Curve Cryptography such as KMOV and Demytko process the message as a point M=(x0,y0) of an elliptic curve with an equation of the form y2≡x3+ax+b(modn) over a finite field when n is a prime number, or over a finite ring when n=pq is an RSA modulus. Other systems use singular cubic curves such as y2≡x3+ax2(modn) and y2+axy≡x3(modn). In this paper, we present a method to find the small solutions of the former modular cubic equations. Our method is based on Coppersmith's technique and enables one to find the solutions (x0,y0) when |x0|3|y0|2 is smaller than the modulus.

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 call

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.