Abstract
Popular secure public key cryptosystems such as RSA and Diffie-Hellman are based on hard problems like factorization and discrete logarithms. These systems often require large prime numbers the size of 300 decimal digits long for the systems to be secure. The generation of large prime numbers is difficult, and larger prime numbers will be required as advances in parallel computing makes factorization of large numbers faster. In this paper, algorithms for digital signatures and public key cryptosystems using multilayer perceptrons (MLPs) are proposed. The security of the algorithm is based on the difficult problem of solving non-linear simultaneous equations. Instead of needing large prime numbers, the algorithm requires multiple real numbers that can be easily generated.
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 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.
