Abstract
In today's Internet, the security of data exchange is possible almost entirely thanks to the RSA algorithm. The asymmetric cryptographic algorithm with the public key allows you to safely make bank transfers or send documents to offices. Digitally signing documents and website certificates would not be possible without it. The theoretical threat to RSA is the Shor algorithm, which is a quantum algorithm that enables prime factorization of the natural number ℵ.The paper presents the analysis of code-based encryption algorithms and their use in generating and verifying a digital signature. These algorithms were implemented and compared in selected digital signature applications. The issues related to correction coding and their application in code-based cryptography were reviewed, the use of code-coding algorithms in generating and verifying the digital signature was analysed and their implementation in order to verify correct operation.
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.
