To investigate the process of cube attack in the world of wireless networks, Nikolaos Petrakos modeled E0 encryption function and implemented cube attack on E0 by performing linear testing which results the number of operations for computational process is 2 21.1. The output of the LFSRs has ended with 12 superpolys or linear coefficients based on the following unknown variables as x5, x6, x7, x8, x9, x10, x11, x12. This way 8 variables out of 16 variables are computed. In this paper, by using Nikolaos Petrakos modeled E0 encryption function and implemented the process of cube attack on E0 by performing quadraticity testing. The output of the LFSRs has ended with 23 superpolys or quadratic coefficients, based on the following unknown variables as x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16. Finally, we were able to compute all the 16 variables with the same time complexity of 2 21.1.