Abstract

This paper proposes an algorithm that creates a digital signature in a nonpositional polynomial notation and forms three surplus residues modulo one extension polynomial base number. Such a signature allows for single-error detection and correction (which is shown to be a unique procedure) and multiple error detection. A formula of cryptographic security is obtained for such a digital signature.

Full Text
Paper version not known

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.