[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Authentication codes based on resilient Boolean maps

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

We introduce three new constructions of systematic authentication codes over finite fields and Galois rings. Our first construction uses resilient functions over finite fields and provides optimal impersonation and substitution probabilities. Our two other constructions are defined over Galois rings: one is based on resilient maps attaining optimal probabilities as well, while the other is based on maps with maximum Fourier transforms. For the special case of characteristic \(p^2\), the maps used on our third construction are bent. Furthermore, we give a generalised construction for the case of characteristic \(p^s\), with \(s \ge 2\). The second and third codes over Galois rings, restricted to the particular case of Galois fields, are different than the first code introduced in this paper: the corresponding source and tag spaces differ, and the encoding maps classes are pairwise different.

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
£29.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 includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bennett C.H., Brassard G., Robert J.M.: Privacy amplification by public discussion. SIAM J. Comput. 17(2), 210–229 (1988).

  2. Carlet C.: More correlation-immune and resilient functions over Galois fields and Galois rings. In: W. Fumy (ed.) EUROCRYPT. Lecture Notes in Computer Science, vol. 1233, pp. 422–433. Springer, Berlin (1997).

  3. Carlet C., Ding C., Niederreiter H.: Authentication schemes from highly nonlinear functions. Des. Codes Cryptogr. 40(1), 71–79 (2006).

  4. Carlet C., Ku-Cauich J.C., Tapia-Recillas H.: Bent functions on a Galois ring and systematic authentication codes. Adv. Math. Commun. 6(2), 249–258 (2012).

  5. Chabaud F., Vaudenay S.: Links between differential and linear cryptanalysis. In: Advances in Cryptology. EuroCrypt’94, pp. 356–365. Springer, Berlin (1995).

  6. Chanson S.T., Ding C., Salomaa A.: Cartesian authentication codes from functions with optimal nonlinearity. Theory Comput. Sci. 290(3), 1737–1752 (2003). doi:10.1016/S0304-3975(02)00077-4.

  7. Chor B., Goldreich O., Håstad J., Friedman J., Rudich S., Smolensky R.: The bit extraction problem of \(t\)-resilient functions (preliminary version). In: FOCS, pp. 396–407. IEEE Computer Society (1985). http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4568115.

  8. Coulter R.S., Matthews R.W.: Bent polynomials over finite fields. Bull. Aust. Math. Soc. 56(3), 429–437 (1997).

  9. Ding C., Niederreiter H.: Systematic authentication codes from highly nonlinear functions. IEEE Trans. Inf. Theory 50(10), 2421–2428 (2004).

  10. Ding C., Wang X.: A coding theory construction of new systematic authentication codes. Theor. Comput. Sci. 330(1), 81–99 (2005). Insightful Theory.

  11. Hou X.D.: \(p\)-ary versions of certain results about bent functions and resilient functions. Finite Fields Appl. 10(4), 566–582 (2004).

  12. Ireland K., Rosen M.: A Classical Introduction to Modern Number Theory. Graduate Texts in Mathematics, Springer, New York (1990).

  13. Özbudak F., Saygi Z.: Some constructions of systematic authentication codes using Galois rings. Des. Codes Cryptogr. 41(3), 343–357 (2006).

  14. Rees R.S., Stinson D.R.: Combinatorial characterizations of authentication codes II. Des. Codes Cryptogr. 7(3), 239–259 (1996). doi:10.1023/A:1018094824862.

  15. Rueppel R.: Analysis and design of stream ciphers. Communications and Control Engineering Series, Springer, Berlin (1986).

  16. Stinson D.R.: Combinatorial characterizations of authentication codes. Des. Codes Cryptogr. 2(2), 175–187 (1992).

  17. Zhang X.M., Zheng Y.: Cryptographically resilient functions. IEEE Trans. Inf. Theory 43(5), 1740–1747 (1997).

Download references

Acknowledgments

The authors express their gratitude to the anonymous referees and to Francisco Zaragoza for their valuable comments. Both authors acknowledge the support of Mexican Conacyt.

Author information

Authors and Affiliations

  1. Computer Science, CINVESTAV-IPN, Mexico City, Mexico

    Juan Carlos Ku-Cauich & Guillermo Morales-Luna

Authors
  1. Juan Carlos Ku-Cauich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guillermo Morales-Luna
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Juan Carlos Ku-Cauich.

Additional information

Communicated by C. Padro.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ku-Cauich, J.C., Morales-Luna, G. Authentication codes based on resilient Boolean maps. Des. Codes Cryptogr. 80, 619–633 (2016). https://doi.org/10.1007/s10623-015-0121-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-015-0121-3

Keywords

Mathematics Subject Classification