Skip to main content

Advertisement

Log in

Authentication Schemes from Highly Nonlinear Functions

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

Abstract

We construct two families of authentication schemes using highly nonlinear functions on finite fields of characteristic 2. This leads to improvements on an earlier construction by Ding and Niederreiter if one chooses, for instance, an almost bent function as the highly nonlinear function.

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

Access this article

Subscribe and save

Springer+ Basic
$34.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 excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

References

  1. A Canteaut P Charpin H Dobbertin (2000) ArticleTitleWeight divisibility of cyclic codes, highly nonlinear functions on F2 m, and crosscorrelation of maximum-length sequences SIAM J Discrete Math 13 105–138 Occurrence Handle2000m:94041 Occurrence Handle10.1137/S0895480198350057

    Article  MathSciNet  Google Scholar 

  2. C Carlet P Charpin V Zinoviev (1998) ArticleTitleCodes, bent functions and permutations suitable for DES-like cryptosystems Designs Codes Cryptogr 15 125–156 Occurrence Handle99k:94030 Occurrence Handle10.1023/A:1008344232130

    Article  MathSciNet  Google Scholar 

  3. Chabaud F, Vaudenay S (1995). Links between differential and linear cryptanalysis, Advances in Cryptology—EUROCRYPT ’94, Lecture Notes in Computer Science, vol. 950. Springer, Berlin, pp 356–365

  4. S Chanson CS Ding A Salomaa (2003) ArticleTitleCartesian authentication codes from functions with optimal nonlinearity Theor Comput Sci 290 1737–1752 Occurrence Handle2003j:94090 Occurrence Handle10.1016/S0304-3975(02)00077-4

    Article  MathSciNet  Google Scholar 

  5. CS Ding H Niederreiter (2004) ArticleTitleSystematic authentication codes from highly nonlinear functions IEEE Trans Inform Theory 50 2421–2428 Occurrence Handle2097058 Occurrence Handle10.1109/TIT.2004.834788

    Article  MathSciNet  Google Scholar 

  6. Helleseth T, Johansson T (1996). Universal hash functions from exponential sums over finite fields and Galois rings, Advances in Cryptology—CRYPTO ’96, Lecture Notes in Computer Science, vol. 1109. Springer, Berlin, pp 31–44

  7. Simmons GJ (1985). Authentication theory/coding theory, Advances in Cryptology—CRYPTO ’84, Lecture Notes in Computer Science, vol. 196. Springer, Berlin, pp 411–431

  8. DR Stinson (1995) Cryptography: theory and practice CRC Press Boca Raton, FL

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Harald Niederreiter.

Additional information

Communicated by J. Wolfmann

Rights and permissions

Reprints and permissions

About this article

Cite this article

Carlet, C., Ding, C. & Niederreiter, H. Authentication Schemes from Highly Nonlinear Functions. Des Codes Crypt 40, 71–79 (2006). https://doi.org/10.1007/s10623-005-6407-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-005-6407-0

Keywords

AMS Classification