Constructing Generalized Bent Functions from Trace Forms of Galois Rings
暂无分享,去创建一个
Xiaoming Zhang | Baofeng Wu | Zhuojun Liu | Qingfang Jin | Zhuojun Liu | Xiaoming Zhang | Baofeng Wu | Qingfang Jin
[1] Mark Giesbrecht,et al. Factoring in Skew-Polynomial Rings over Finite Fields , 1998, J. Symb. Comput..
[2] Yongqiang Li,et al. Permutation polynomials EA-equivalent to the inverse function over GF (2n) , 2011, Cryptography and Communications.
[3] Patrick Solé,et al. Connections between Quaternary and Binary Bent Functions , 2009, IACR Cryptol. ePrint Arch..
[4] Rudolf Lide,et al. Finite fields , 1983 .
[5] B. R. McDonald. Finite Rings With Identity , 1974 .
[6] Joachim von zur Gathen. Tests for Permutation Polynomials , 1991, SIAM J. Comput..
[7] Baofeng Wu,et al. Linearized polynomials over finite fields revisited , 2012, Finite Fields Their Appl..
[8] Kenneth G. Paterson,et al. Generalized Reed-Muller codes and power control in OFDM modulation , 1998, IEEE Trans. Inf. Theory.
[9] K.-U. Schmidt. Quaternary Constant-Amplitude Codes for Multicode CDMA , 2009, IEEE Trans. Inf. Theory.
[10] Igor E. Shparlinski. A deterministic test for permutation polynomials , 2005, computational complexity.