Abstract
The concept of asymmetric cryptographic algorithms introduced by W. Diffie and M. Hellman in 1976 is considered. The problems of factorization of large integers and finding discrete logarithms for elements of finite large-order groups are presented. It is proved that asymmetric cryptographic algorithms based on the problem of finding a discrete logarithm for points of an elliptic curve over a finite field should be used in modern information technology.
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.
