Skip to main content
SpringerLink
Log in

Multicovering Radii of Reed-Muller Codes and the Existence of Secure Stream Ciphers (Extended Abstract)

  • Conference paper
Sequences and their Applications

Part of the book series: Discrete Mathematics and Theoretical Computer Science ((DISCMATH))

  • 358 Accesses

Abstract

The multi-covering radii of a code are recent generalizations of the covering radius of a code. In this paper upper bounds are found for the multicovering radii of first order Reed-Muller codes. They are exact in some cases. These bounds are then used to prove the existence of secure families of keystreams against a general class of cryptanalytic attacks.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. J. Balcázar, J. Díaz, and J. Gabarró, “Structural Complexity I,” Springer-Verlag, Berlin, 1988.

    Book  Google Scholar 

  2. G.D. Cohen, M.G. Karpovsky, H.F. Mattson Jr., and J.R. Schatz, Covering radius — survey and recent results, IEEE Trans. Info. Theory IT -31 (1985), 328–343.

    Article  MathSciNet  Google Scholar 

  3. G. Cohen, I. Honkala, S. Litsyn and A. Lobstein “Covering Codes,” Elsevier, Amsterdam, 1997.

    Google Scholar 

  4. G. Cohen and S. Litsyn, On the covering radius of Reed-Muller codes Discrete Mathematics, 106–107 (1992), 147–155.

    Article  MathSciNet  Google Scholar 

  5. G.D. Cohen, S.N. Litsyn, A.C. Lobstein, and H.F. Mattson Jr.. “Covering Radius 1985–1994,” Dept. Informatique, Ecole Nationale Supérieure des Télécommunications, Technical Report 94 D 025, 1994.

    Google Scholar 

  6. T. Helleseth, T. Klove, and J. Mykkeltveit, On the covering radius of binary codes, IEEE Trans. Info. Theory IT-24 (1978), 627–628.

    Article  MathSciNet  Google Scholar 

  7. A. Klapper, The Multicovering radii of codes, IEEE Trans. Info. Theory 43 (1997), 1372–1377.

    Article  MathSciNet  MATH  Google Scholar 

  8. . A. Klapper, On the existence of secure keystream generators, to appear, J. Cryptology.

    Google Scholar 

  9. F.J. MacWilliams and N.J.A. Sloane, “The Theory of Error Correcting Codes,” North-Holland, Amsterdam, 1977.

    Google Scholar 

  10. O. Rothaus, On `bent’ functions, J. Combin. Thy., Se. A, 20 (1976) 300–305.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Turku, Turku, 20014, Finland

    Iiro Honkala

  2. Department of Computer Science, University of Kentucky Lexington, KY, 40506-0046, USA

    Andrew Klapper

Authors
  1. Iiro Honkala
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew Klapper
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, School of Computing, National University of Singapore, Lower Kent Ridge Road, Singapore, 119260

    C. Ding

  2. Department of Informatics, University of Bergen, N-5020, Bergen, Norway

    T. Helleseth

  3. Institute of Information Processing, Austrian Academy of Sciences, Sonnenfelsgasse 19, A01010, Vienna, Austria

    H. Niederreiter

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag London

About this paper

Cite this paper

Honkala, I., Klapper, A. (1999). Multicovering Radii of Reed-Muller Codes and the Existence of Secure Stream Ciphers (Extended Abstract). In: Ding, C., Helleseth, T., Niederreiter, H. (eds) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0551-0_18

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-0551-0_18

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-196-2

  • Online ISBN: 978-1-4471-0551-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation