Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Exponentiation modulo a polynomial for data security

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

This paper describes some properties of exponentiation modulo a polynomial and suggests its use for encryption in a mode that can be cryptanalyzed in approximatelyO(pd 3) time, whered is the size of the message frame andp is the prime modulo which the rankwise computations are carried out. While for sufficiently largepd (∼105) this appears to provide a one-way function which can be used in a public-key cryptosystem, we show that since encryption/ decryption effort is defined inO(d 2 logpd log logp) time, a practical application of the proposed algorithm would be either in a secret key or in a tamper-proof, hardwired secret polynomial system.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. W. Diffie and M. E. Hellman, Privacy and authentication: an introduction to cryptography,Proc. IEEE 67:397–427 (March 1979).

    Google Scholar 

  2. G. H. Hardy and E. M. Wright,An Introduction to the Theory of Numbers, Oxford University Press, Oxford (1954).

    Google Scholar 

  3. S. C. Kak, An encryption algorithm modulo a polynomial in GF(p), Technical Report ECE 608, LSU (May 1982).

  4. D. E. Knuth,The Art of Computer Programming, Vol. 2, Addison Wesley, Reading, Massachusetts (1971).

    Google Scholar 

  5. A. Lempel, Cryptology in transition,Computing Surveys 11:285–303 (December 1979).

    Google Scholar 

  6. M. O. Rabin, Probabilistic algorithms in finite fields, Technical Report MIT/LCS/TR-213, MIT (January 1979).

  7. R. L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems,Commun. ACM 21:120–126 (February 1978).

    Google Scholar 

  8. A. Shamir, A polynomial time algorithm for breaking Merkle-Hellman cryptosystems, inProceedings IEEE Foundations of Computer Science Conference (1982).

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Louisiana State University, 70803, Baton Rouge, Louisiana

    Subhash C. Kak

Authors
  1. Subhash C. Kak
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kak, S.C. Exponentiation modulo a polynomial for data security. International Journal of Computer and Information Sciences 12, 337–346 (1983). https://doi.org/10.1007/BF01008045

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01008045

Key words

Search

Navigation