Skip to main content

On Applications of Singular Matrices over Finite Fields in Cryptography

  • Conference paper
Security Aspects in Information Technology (InfoSecHiComNet 2011)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 7011))

Included in the following conference series:

  • 565 Accesses

Abstract

The main goal of this paper is to exhibit the use of singular matrices over finite fields in cryptography. Using these matrices, we propose a key exchange method in which two users over an insecure channel want to agree upon a secret key to be used in some private key cryptosystem.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Galois, E.: Sur La théorie Des Nombres. Bull. Sci. Math. de M. Ferussac 30, 428–435 (1830)

    Google Scholar 

  2. Koblitz, N.: Elliptic Curve Cryptosystems. Mathematics of Computation 48, 203–209 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  3. Levine, J., Brawley, J.V.: Some Cryptographic Applications of Permutation Polynomials. Cryptologia 1, 76–92 (1977)

    Article  Google Scholar 

  4. Lidl, R., Muller, W.B.: Permutation Polynomials in Rsacryptosystems. In: Advances in Cryptology, pp. 293–301 (1984)

    Google Scholar 

  5. Massey, J.L.: Shift-register Synthesis and BCH Decoding. IEEE Trans. Information Theory 15, 122–127 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  6. Schwenk, J., Huber, K.: Public Key Encryption and Digital Signatures Based on Permutation Polynomials. Electronics Letters 34(2), 759–760 (1998)

    Article  Google Scholar 

  7. Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1968)

    MATH  Google Scholar 

  8. Shparlinski, I.E.: Finite Fields: Theory and Computation. Kluwer Academic Publishers, Dordrecht (1999)

    Book  MATH  Google Scholar 

  9. Daemen, J., Rijmen, V.: The Design of Rijndael: AES - The Advanced Encryption Standard. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  10. Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applictions. Cambridge University Press, Cambridge (1994)

    Book  MATH  Google Scholar 

  11. Koblitz, N.: Algebraic Aspects of Cryptography. Springer, Heidelberg (1999)

    Google Scholar 

  12. Lidl, R., Niederreiter, H.: Finite Fields: Encyclopedia of Mathematics and Its Applications. Cambridge University Press, Cambridge (1997)

    Google Scholar 

  13. Menezes, A.J., Blake, I.F., Gao, X., Mullin, R.C., Vanstone, S.A.: Applications of Finite Fields. Kluwer Academic Publishers, Dordrecht (1993)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yadav, D.S., Sharma, R.K., Shukla, W. (2011). On Applications of Singular Matrices over Finite Fields in Cryptography. In: Joye, M., Mukhopadhyay, D., Tunstall, M. (eds) Security Aspects in Information Technology. InfoSecHiComNet 2011. Lecture Notes in Computer Science, vol 7011. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24586-2_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24586-2_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24585-5

  • Online ISBN: 978-3-642-24586-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics