Exponentiation modulo a polynomial for data security

DOI10.1007/BF01008045MaRDI QIDQ3038618zbMATH OpenWikidataFDO

Authors Subhash C. Kak

Publication date 1983

Published in International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01008045

zbMATH Keywords

cryptographydata securityencryptionRSA algorithmcomposite polynomial in GF(p)exponentiation modulo a polynomialsecret-hardware public-key cryptosystems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials over finite fields (11T06) Communication, information (94A99)

Cites work

• scientific article; zbMATH DE number 3092634 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems

Cited in

(2)

• A distributed data storage scheme for sensor networks
• Online data storage using implicit security

This page was built for publication: Exponentiation modulo a polynomial for data security

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3038618)