Skip to main content

Constructing Generalized Bent Functions from Trace Forms of Galois Rings

  • Conference paper
  • First Online:
Computer Mathematics
  • 709 Accesses

Abstract

Quaternary constant-amplitude codes (codes over \({\mathbb Z}_4\)) of length \(2^m\) exist for every positive integer \(m\), and every codeword of such a code corresponds to a function from the binary \(m\)-tuples to \({\mathbb Z}_4\) having the bent property, called a generalized bent function. In this chapter, we extend previous constructions and propose a general approach which can lead to more generalized bent functions.

This research is supported by National Basic Research Program of China (Grant No. 2011CB302400).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Gathen, J.V.Z.: Tests for permutation polynomials. SIAM J. Comput. 20, 591–602 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  2. Giesbrecht, M.: Factoring in skew-polynomial rings over finite fields. J. Symb. Comput. 26, 463–486 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Li, Y., Wang, M.: Permutation polynomials EA-equivalent to the inverse function over GF(\(2^n\)). Cryptogr. Commun. 3(3), 175–186 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1997)

    Google Scholar 

  5. McDonald, B.R.: Finite Rings with Identity. Marcel Dekker, New York (1974)

    MATH  Google Scholar 

  6. Paterson, K.G.: Generalized Reed-Muller codes and power control in OFDM modulation. IEEE Trans. Inf. Theory 46, 104–120 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Schmidt, K.U.: Quaternary constant-amplitude codes for multicode CDMA. IEEE Trans. Inf. Theory 55, 1824–1832 (2009)

    Article  Google Scholar 

  8. Shparlinski, I.E.: A deterministic test for permutation polynomials. Comput. Complex. 2, 129–132 (1992)

    Article  MATH  Google Scholar 

  9. Solé P., Tokareva N.: Connections between quaternary and binary bent functions. In: Cryptology ePrint Archives http://www.eprint.iacr.org/2009/544 (2009)

  10. Wu, B., Liu, Z.: Linearized polynomials over finite fields revisited. Finite Fields Appl. 2, 79–100 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Xiaoming Zhang , Baofeng Wu , Qingfang Jin or Zhuojun Liu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, X., Wu, B., Jin, Q., Liu, Z. (2014). Constructing Generalized Bent Functions from Trace Forms of Galois Rings. In: Feng, R., Lee, Ws., Sato, Y. (eds) Computer Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43799-5_31

Download citation

Publish with us

Policies and ethics