Abstract
Most of the studies on public key cryptosystems (PKC) have been centered around hard number theoretic problems. These techniques have been adapted for the construction of PKCs based on hard problems in language theory. A few PKCs have been constructed and this paper is a continuation in that direction based on the extensive studies on Lyndon words.
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.
