Walsh Sampling with Incomplete Noisy Signals

  • Yi Janet Lu
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 887)


With the advent of massive data outputs at a regular rate, admittedly, signal processing technology plays an increasingly key role. Nowadays, signals are not merely restricted to physical sources, they have been extended to digital sources as well. Under the general assumption of discrete statistical signal sources, we propose a practical problem of sampling incomplete noisy signals for which we do not know a priori and the sampling size is bounded. We approach this sampling problem by Shannon’s channel coding theorem. Our main results demonstrate that it is the large Walsh coefficient(s) that characterize(s) discrete statistical signals, regardless of the signal sources. By the connection of Shannon’s theorem, we establish the necessary and sufficient condition for our generic sampling problem for the first time. Our generic sampling results find practical and powerful applications in not only statistical cryptanalysis, but software system performance optimization.


Walsh transform Shannon’s channel coding theorem Channel capacity Classical distinguisher Statistical cryptanalysis Generic sampling Digital signal processing 


  1. 1.
    Arimoto, S.: An algorithm for computing the capacity of arbitrary discrete memoryless channels. IEEE Trans. Inform. Theory IT-18, 14-20 (1972)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Blackledge, J.M.: Digital Signal Processing - Mathematical and Computational Methods. Software Development and Applications, 2nd edn. Horwood Publishing, England (2006)CrossRefGoogle Scholar
  3. 3.
    Blahut, R.: Computation of channel capacity and rate distortion functions. IEEE Trans. Inform. Theory IT-18, 460–473 (1972)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Chen, X., Guo, D.: Robust sublinear complexity walsh-hadamard transform with arbitrary sparse support. In: IEEE International Symposium Information Theory, pp. 2573–2577 (2015)Google Scholar
  5. 5.
    Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. John Wiley & Sons, Hoboken (2006)zbMATHGoogle Scholar
  6. 6.
    Csiszár, I.: Generalized cutoff rates and rényi’s information measures. IEEE Trans. Inform. Theory 41(1), January 1995Google Scholar
  7. 7.
    Dinur, I., Dunkelman, O., Keller, N., Shamir, A.: Memory-efficient algorithms for finding needles in haystacks. In: CRYPTO 2016. Part II, LNCS, vol. 9815, pp. 185–206 (2016)CrossRefGoogle Scholar
  8. 8.
    Gray, R.M., Davisson, L.D.: An Introduction to Statistical Signal Processing. Cambridge University Press (2004).
  9. 9.
    Horadam, K.J.: Hadamard Matrices and Their Applications. Princeton University Press, Princeton (2007)zbMATHGoogle Scholar
  10. 10.
    Joux, A.: Algorithmic Cryptanalysis. Cryptography and Network Security. Chapman & Hall/CRC, Boca Raton (2009)CrossRefGoogle Scholar
  11. 11.
    Li, X., Bradley, J.K., Pawar, S., Ramchandran, K.: The SPRIGHT algorithm for robust sparse Hadamard transforms. In: IEEE International Symposium Information Theory, pp. 1857–1861 (2014)Google Scholar
  12. 12.
    Lu, Y., Desmedt, Y.: Walsh transforms and cryptographic applications in bias computing. Cryptogr. Commun. 8(3), 435–453 (2016). SpringerGoogle Scholar
  13. 13.
    Lu, Y.: New Linear Attacks on Block Cipher GOST, IACR eprint (2017).
  14. 14.
    Lu, Y.: New Results on the DMC Capacity and Renyi’s Divergence (2017). arXiv:1708.00979
  15. 15.
    Meier, W., Staffelbach, O.: Fast correlation attacks on certain stream ciphers. J. Cryptol. 1(3), 159–176 (1989). SpringerGoogle Scholar
  16. 16.
    Reed, D.A., Dongarra, J.: Exascale computing and big data: the next frontier. Commun. ACM 58(7), 56–68 (2015)CrossRefGoogle Scholar
  17. 17.
    Scheibler, R., Haghighatshoar, S., Vetterli, M.: A fast hadamard transform for signals with sublinear sparsity in the transform domain. IEEE Trans. Inf. Theory 61(4), 2115–2132 (2015)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Shokrollahi, M.A.: Personal Communication (2006)Google Scholar
  19. 19.
    Vaudenay, S.: An experiment on DES - statistical cryptanalysis. In: Third ACM Conference on Computer Security, pp. 139–147 (1996)Google Scholar
  20. 20.
    Vaudenay, S.: A Classical Introduction to Modern Cryptography. Applications for Communications Security. Springer, New York (2006)zbMATHGoogle Scholar
  21. 21.
    S. Vaudenay, A Direct Product Theorem, submittedGoogle Scholar
  22. 22.
    Zhang, B., Xu, C., Meier, W.: Fast correlation attacks over extension fields, large-unit linear approximation and cryptanalysis of SNOW 2.0. In: CRYPTO 2015, LNCS Vol. 9215, pp. 643–662, Springer (2015)Google Scholar
  23. 23.
    Zhang, B., Xu, C., Feng, D.: Practical cryptanalysis of bluetooth encryption with condition masking. J. Cryptol. (2017). Springer, Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.National Research Center of Fundamental SoftwareBeijingPeople’s Republic of China
  2. 2.Department of InformaticsUniversity of BergenBergenNorway

Personalised recommendations