Skip to main content
SpringerLink
Log in

Public key cryptography based on ergodic matrices over finite field

  • Cryptography
  • Published:
Wuhan University Journal of Natural Sciences

Abstract

A new public key encryption scheme is proposed in this paper, which is based on a hard problem over ergodic matrices. The security of this scheme is equal to the MQ-problem: multivariate quadratic equations over finite fields. This problem has been shown to be NP-complete and can't be solved with polynomial time algorithm.

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

Access this article

Log in via an institution

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. Alfred J M, Paul C V, Scott A V.Handbook of Applied Cryptography [M]. New York: CRC Press, 1997: 175–179.

    Google Scholar 

  2. Bruce S.Applied Cryptography: Protocols, Algorithms, and Source Code in C [M]. Hoboken: John Wiley & Sons, Inc. 1996:231–236.

    Google Scholar 

  3. Aviad K, Adi S. Cryptanalysis of the HFE Public Key Cryptosystem [C]. //Proceedings of Crypto' 99. Berlin: Springer, 1999:19–30.

    Google Scholar 

  4. Nicolas C. The Security of Hidden Field Equations (HFE) Cryptographers [C]. //Track RSA Conference 2001 Berlin: Springer, 2001:266–281.

    Google Scholar 

  5. Jean C F, Antoine J. Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases[C]//Crypto 2003. Berlin: Springer, 2003:44–60.

    Google Scholar 

  6. Zhao Yongzhe, Wang Liou, Zhang Wei. Information-Exchange Using the Ergodic Matrices in GF(2) [C]//2th International Conference on Applied Cryptography and Network Security (ACNS 2004) Yellow Mountain, China, Jun 2004: 388–397.

  7. Zhao Yongzhe, Huang Shenglie, Jiang Zhanhua. Ergodic Matrices over GF(2k) and Their Properties[J].Mini-Micro Systems, 2005,26(12):35–39 (Ch).

    Google Scholar 

  8. Rudolf L, Havald N.Introduction to Finite Fields and Their Applications [M]. Cambridge: Cambridge University. Press, 1994:23–31.

    Google Scholar 

  9. Shafi G, Silvio M. Probabilistic Encryption [J].Journal of Computer and System Science, 1984,28(2):270–299.

    Article  MATH  Google Scholar 

  10. Danny D, Cynthia D, Moni N. Non Malleable Cryptography [J].SIAM Journal on Computing, 2000,30(2):391–437.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Jilin University, 130012, Changchun, Jilin, China

    Pei Shihui, Zhao Hongwei & Zhao Yongzhe

Authors
  1. Pei Shihui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhao Hongwei
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhao Yongzhe
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhao Hongwei.

Additional information

Foundation item: Supported by the Specialized Research Fund for the Doctoral Program of Higher Education of China (20050183032) and the Science Foundation Project of Jillin Province Education Office (2005180, 2005181)

Biography: PEI Shihui (1969-), male, Ph.D. candidate, research direction: applied cryptography.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shihui, P., Hongwei, Z. & Yongzhe, Z. Public key cryptography based on ergodic matrices over finite field. Wuhan Univ. J. Nat. Sci. 11, 1525–1528 (2006). https://doi.org/10.1007/BF02831812

Download citation

  • Received:

  • Issue Date:

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

Key words

CLC number

Search

Navigation