A quantum algorithm for testing and learning resiliency of a Boolean function

A quantum algorithm to evaluate the resiliency of a Boolean function is explored. Recently, Chakraborty and Maitra (Cryptogr Commun 8(3):401–413, 2016) have provided quantum algorithms to check the non-resiliency of a Boolean function. However, the shortage of their algorithms is that they just output YES or NO. Refining one of the algorithms, a quantum algorithm is proposed here, which can describe the extent of the non-resiliency by $$\epsilon $$ϵ-almost resiliency under the condition NO.

[1]  Anne Canteaut,et al.  On cryptographic properties of the cosets of R(1, m) , 2001, IEEE Trans. Inf. Theory.

[2]  Kaoru Kurosawa,et al.  Almost security of cryptographic Boolean functions , 2004, IEEE Transactions on Information Theory.

[3]  Yuliang Zheng,et al.  Cryptographically resilient functions , 1997, IEEE Trans. Inf. Theory.

[4]  Subhamoy Maitra,et al.  Application of Grover’s algorithm to check non-resiliency of a Boolean function , 2015, Cryptography and Communications.

[5]  WeiGuo Zhang,et al.  Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables , 2009, IEEE Transactions on Information Theory.

[6]  Gilles Brassard,et al.  Privacy Amplification by Public Discussion , 1988, SIAM J. Comput..

[7]  Oded Goldreich,et al.  The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[8]  Palash Sarkar,et al.  Construction of Nonlinear Boolean Functions with Important Cryptographic Properties , 2000, EUROCRYPT.

[9]  Li Yang,et al.  A quantum algorithm for approximating the influences of Boolean functions and its applications , 2014, Quantum Information Processing.

[10]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[11]  Anne Canteaut,et al.  Correlation-Immune and Resilient Functions Over a Finite Alphabet and Their Applications in Cryptography , 1999, Des. Codes Cryptogr..

[12]  Enes Pasalic,et al.  Generalized Maiorana–McFarland Construction of Resilient Boolean Functions With High Nonlinearity and Good Algebraic Properties , 2014, IEEE Transactions on Information Theory.

[13]  James L. Massey,et al.  A spectral characterization of correlation-immune combining functions , 1988, IEEE Trans. Inf. Theory.

[14]  Jürgen Bierbrauer,et al.  Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications , 2000, CRYPTO.

[15]  Qiaoyan Wen,et al.  Results on Almost Resilient Functions , 2006, ACNS.

[16]  Douglas R. Stinson,et al.  Three characterizations of non-binary correlation-immune and resilient functions , 1995, Des. Codes Cryptogr..

[17]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[18]  Kaoru Kurosawa,et al.  Almost k -Wise Independent Sample Spaces and Their Cryptologic Applications , 2001, Journal of Cryptology.