Skip to main content
Springer Nature Link
Log in

A digital signature scheme based on linear error-correcting block codes

  • Conference paper
  • First Online:
Advances in Cryptology — ASIACRYPT'94 (ASIACRYPT 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 917))

Included in the following conference series:

Abstract

A true trapdoor digital signature scheme is presented. The scheme uses linear error-correcting block codes in a manner similar to that of the McEliece public-key cryptosystem, the Rao-Nam private-key cryptosystem, and the three digital signature schemes proposed by Xinmei, Harn and Wang, and the authors. All these digital signature schemes have been shown to be susceptible to a number of attacks. The signature scheme described in this paper derives its security from the complexity of three problems: the decoding of general linear error-correcting block codes, the factoring of large matrices, and the derivation of a matrix from its right inverse. It is shown that the proposed scheme is resistant to the attacks that proved successful when used against the aforementioned digital signature schemes as well as other attacks. The required public key storage is about 3n 2 bits. The complexity of the signature generation and validation algorithms are O(n 2) and O(nk) bit operations respectively, thus making the scheme amenable to use in high data rate applications.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Diffie and M. E. Hellman. New direction in cryptography. IEEE Transactions on Information theory, 22(11):644–654, November 1976.

    Google Scholar 

  2. R. J. McEliece. Public-key cryptosystem based on algebraic coding theory. JPL DSN Progress Report 42–44, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, USA, January & February 1987, pages 114–116.

    Google Scholar 

  3. E. R. Berlekamp, R.J. McEliece, and H. van Tilborg. On the inherent intractibility of certain coding problem. IEEE Transactions on Information theory, IT-24(3):384–386, May 1978.

    Google Scholar 

  4. W. Xinmei. Digital signature scheme based on error-correcting codes. Electronics Letters, 26(13):898–899, 21st June 1990.

    Google Scholar 

  5. T. R. N. Rao and K. Nam. Private-key algebraic-code encryption. IEEE Transactions on Information theory, 35(4):829–833, July 1989.

    Google Scholar 

  6. L. Harn and D.-C. Wang. Cryptanalysis and modification of digital signature scheme based on error-correcting codes. Electronics Letters, 28(2):157–159, 16th January 1992.

    Google Scholar 

  7. M. Alabbadi and S. B. Wicker. Security of Xinmei's digital signature scheme. Electronics Letters, 28(9):890–891, 23rd April 1992.

    Google Scholar 

  8. M. Alabbadi and S. B. Wicker. Cryptanalysis of the Harn and Wang modification of the Xinmei digital signature scheme. Electronics Letters, 28(18):1756–1758, 27th August 1992.

    Google Scholar 

  9. J. van Tilburg. Cryptanalysis of Xinmei digital signature scheme. Electronics Letters, 28(20):1935–1936, 24th September 1992.

    Google Scholar 

  10. M. Alabbadi and S. B. Wicker. Digital signature schemes based on errorcorrecting codes. In IEEE International Symposium on Information Theory, page 199, San Antonio, Texas, USA, January 17–22 1993.

    Google Scholar 

  11. M. Alabbadi and S. B. Wicker. Susceptiblity of digital signature schemes based on error-correcting codes to universal forgery. In The Workshop on Information Protection, Moscow, December 6–9 1993.

    Google Scholar 

  12. J. van Tilburg. Cryptanalysis of the Alabbadi-Wicker digital signature scheme. In Proceedings of the Fourteenth Symposium on Information Theory in the Benelux, pages 114–119, Veldhoven, Netherlands, May 17–18 1993.

    Google Scholar 

  13. R. Struik and J. van Tilburg. The Rao-Nam scheme is insecure against a chosen plaintext attack. In C. Pomeranc, editor, Advances in Crypology-Crypto'87 Proceedings, pages 445–457, Santa Barbara, CA, USA, August 16–20 1987, Springer-Verlag. (Lecture Notes in Computer Science # 239).

    Google Scholar 

  14. J. Meijers and J. van Tilburg. On the Rao-Nam private-key cryptosystem using linear codes. In IEEE International Symposium on Information Theory, page 126, Budapest, Hungar, June 24–28 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. KACST, P.O.Box 6086, 11442, Riyadh, Saudi Arabia

    Mohssen Alabbadi

  2. Georgia Tech-Lorraine, 2 et 3 Rue Marconi, 57070, Metz, France

    Stephen B. Wicker

Authors
  1. Mohssen Alabbadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stephen B. Wicker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Josef Pieprzyk Reihanah Safavi-Naini

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alabbadi, M., Wicker, S.B. (1995). A digital signature scheme based on linear error-correcting block codes. In: Pieprzyk, J., Safavi-Naini, R. (eds) Advances in Cryptology — ASIACRYPT'94. ASIACRYPT 1994. Lecture Notes in Computer Science, vol 917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000438

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59339-3

  • Online ISBN: 978-3-540-49236-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation