Abstract
Boolean functions play an important role in symmetric cryptosystems. In this paper, we have constructed near-bent Boolean functions algebraically with the help of Niho power function exponent in the trace form over a finite field. Specific cryptographic properties which may gain attention with suitable modifications are observed using these functions. If exponents are either Mersenne numbers or Fermat numbers, then the resulting functions are found to be APN (almost perfect nonlinear).
Similar content being viewed by others
Change history
12 March 2020
Remark 4.1 and Remark 4.5 in Section 4 will be true only if a is a power of two.
12 March 2020
Remark 4.1 and Remark 4.5 in Section 4 will be true only if a is a power of two.
References
Abłamowicz, R., Fauser, B.: CLIFFORD: A Maple 11 Package for Clifford Algebra Computations, version 11, p. 28 (2008). Retrieved Feb (2007)
Canteaut, A., Charpin, P., Dobbertin, H.: A new characterization of almost bent functions. International Workshop on Fast Software Encryption, pp. 186–200. Springer, Berlin (1999)
Carlet, C.: Nonlinearity of Boolean Functions, pp. 848–849. Springer, Boston (2011)
Carlet, C.: Boolean and vectorial plateaued functions and APN functions. IEEE Trans. Inf. Theory 61(11), 6272–6289 (2015)
Charpin, P., Pasalic, E., Tavernier, C.: On bent and semi-bent quadratic Boolean functions. IEEE Trans. Inf. Theory 51(12), 4286–4298 (2005)
Chee, S., Lee, S., Kim, K.: Semi-bent Functions, pp. 105–118. Springer, Berlin (1995)
Courtois, N.T., Meier, W.: Algebraic attacks on stream ciphers with linear feedback. International Conference on the Theory and Applications of Cryptographic Techniques, pp. 345–359. Springer, Berlin (2003)
Dillon, J.F., Mcguire, G.: Near bent functions on a hyperplane. Finite Fields Appl. 14(3), 715–720 (2008)
Dobbertin, H.: Almost perfect nonlinear power functions on GF (\(2^n\)): the Niho case. Inf. Comput. 151(1–2), 57–72 (1999)
Dobbertin, H.: Almost perfect nonlinear power functions on GF (\(2^n\)): the Welch case. IEEE Trans. Inf. Theory 45(4), 1271–1275 (1999)
Dobbertin, H.: Almost perfect nonlinear power functions on GF (\(2^n\)): a new case for \(n\) divisible by 5. Finite Fields and Applications, pp. 113–121. Springer, Berlin (2001)
Dobbertin, H., Leander, G., Canteaut, A., Carlet, C., Felke, P., Gaborit, P.: Construction of bent functions via Niho power functions. J. Comb Theory A 113(5), 779–798 (2006)
Dong, D., Qu, L., Fu, S., Li, C.: New constructions of semi-bent functions in polynomial forms. Math. Comput. Model. 57(5–6), 1139–1147 (2013)
Fine, N.J.: On the Walsh functions. Trans. Am. Math. Soc. 65(3), 372–414 (1949)
Gold, R.: Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.). IEEE Trans. Inf. Theory 14(1), 154–156 (1968)
Hagmark, P.E., Lounesto, P.: Walsh functions, Clifford algebras and Cayley–Dickson process. Clifford Algebras and Their Applications in Mathematical Physics, pp. 531–540. Springer, Dordrecht (1986)
Janwa, H., Wilson, R.M.: Hyperplane sections of Fermat varieties in \(P^3\) in char. 2 and some applications to cyclic codes. International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, pp. 180–194. Springer, Berlin (1993)
Kasami, T.: The weight enumerators for several classes of subcodes of the 2nd order binary Reed–Muller codes. Inf. Comput. 18(4), 369–394 (1971)
Khoo, K., Gong, G., Stinson, D., R.: A new family of Gold-like sequences. Proceedings IEEE International Symposium on Information Theory, IEEE, p. 181 (2002)
Khoo, K., Gong, G., Stinson, D.R.: A new characterization of semi-bent and bent functions on finite fields. Des. Code. Cryptogr. 38(2), 279–295 (2006)
Lee, D.H., Kim, J., Hong, J., Han, J.W., Moon, D.: Algebraic attacks on summation generators. International Workshop on Fast Software Encryption, pp. 34–48. Springer, Berlin (2004)
McEliece, R.J.: Finite Fields for Computer Scientists and Engineers, p. 23. Springer, Berlin (2012)
Meier, W., Staffelbach, O.: Fast correlation attacks on stream ciphers. Workshop on the Theory and Application of of Cryptographic Techniques, pp. 301–314. Springer, Berlin (1988)
Meier, W., Staffelbach, O.: Nonlinearity criteria for cryptographic functions. Workshop on the Theory and Application of Cryptographic Techniques, pp. 549–562. Springer, Berlin (1989)
Mesnager, S.: Bent Functions. Springer, Berlin (2016)
Mukhopadhyay, D., Chowdhury, D.R.: A parallel efficient architecture for large cryptographically robust \(n \times k\; (k> n/2)\) mappings. IEEE Trans. Comput. 60(3), 375–385 (2010)
Nyberg, K.: Differentially uniform mappings for cryptography. Workshop on the Theory and Application of of Cryptographic Techniques, pp. 55–64. Springer, Berlin (1993)
Rothaus, O.S.: On “bent” functions. J. Comb. Theory A 20(3), 300–305 (1976)
Tokareva, N.: Bent Functions: Results and Applications to Cryptography. Academic Press, Cambridge (2015)
Wu, C.K., Feng, D.: Boolean Functions and Their Applications in Cryptography. Springer, Berlin (2016)
Zheng, Y., Zhang, X.M.: Plateaued functions. International Conference on Information and Communications Security, pp. 284–300. Springer, Berlin (1999)
Acknowledgements
The authors would like to thank the Editor-in-chief and the anonymous referees for their valuable comments and suggestions, which helped us to improve the quality of this manuscript. The corresponding author and the second author acknowledges Manipal Institute of Technology (MIT), Manipal Academy of Higher Education, India, for their kind encouragement. The first author is grateful to Manipal Academy of Higher Education for their support through the Dr. T. M. A. Pai Ph. D. scholarship program.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Rafał Abłamowicz
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Poojary, P., Panackal, H. & Bhatta, V.G.R. Algebraic Construction of Near-Bent and APN Functions. Adv. Appl. Clifford Algebras 29, 93 (2019). https://doi.org/10.1007/s00006-019-1012-x
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00006-019-1012-x