We analyze the effectivity of different pseudo noise (PN) and orthogonal sequences for encrypting speech signals in terms of perceptual intelligence. Speech signal can be viewed as sequence of correlated samples and each sample as sequence of bits. The residual intelligibility of the speech signal can be reduced by removing the correlation among the speech samples. PN sequences have random like properties that help in reducing the correlation among speech samples. The mean square aperiodic auto-correlation (MSAAC) and the mean square aperiodic cross-correlation (MSACC) measures are used to test the randomness of the PN sequences. Results of the investigation show the effectivity of large Kasami sequences for this purpose among many PN sequences., {"references":["H. J. Beker and F. C. Piper, Secure Speech Communications, London:\nAcademic Press, 1985.","W. Stallings, Cryptography and Network Security, Englewoods Cliffs,\nNJ: Prentice Hall, 2003.","W. Diffe and M. E. Hellman, \"New directions in cryptography,\" IEEE\nTrans. Inform. Theory, vol. 22, pp. 644-654, Nov. 1976.","N. S. Jayant, B. J. McDermott, S. W. Christensen and A. M. Quinn, \"A\ncomparison of four methods for analog speech privacy,\" IEEE Trans.\nCommun., vol. COM-29, pp. 18-23, Jan. 1981.","B. Goldburg, S. Sridharan and E. Dawson, \"Design and cryptanalysis of\ntransform based speech scramblers,\" IEEE J. Selected Areas Commun.,\nvol. 11, no. 5, pp. 735-744, June 1993.","R. L. Pickholtz, D. L. Schilling and L. B. Milstein, \"Theory of spread\nspectrum communications ÔÇö A tutorial,\" IEEE Trans. Commun., vol.\nCOM-30, no. 5, May 1982.","E. H. Dinan and B. Jabbari, \"Spreading codes for direct sequence CDMA\nand wideband CDMA cellular networks,\" IEEE Commun. Magazine, vol.\n36, no. 4, pp. 48-54, Sep. 1998.","B. Sklar, Digital Communications: Fundamentals and Applications, 2nd\nEd., NJ: Prentice Hall, 2001.","J. H. Lindholm, \"An analysis of the pseudo randomness properties of\nthe subsequences of long m-sequences,\" IEEE Trans. Inform. Theory,\nvol. IT-14, pp. 569-576, July 1968.\n[10] I. Oppermann and B. S. Vucetic, \"Complex spreading sequences with a\nwide range of correlation properties,\" IEEE Trans. Commun., vol. COM-\n45, pp. 365-375, March 1997.\n[11] L. T. Wang and E. J. McCluskey, \"Linear feedback shift register design\nusing cyclic codes,\" IEEE Trans. Comput., vol. 37, pp. 1302-1306, Oct.\n1988.\n[12] A. Fuster and L. J. Garcia, \"An efficient algorithm to generate binary\nsequences for cryptographic purposes,\" Theoretical Computer Science,\nvol. 259, pp. 679-688, May 2001.\n[13] D. V. Sarwate and M. B. Pursley, \"Correlation properties of pseudo\nrandom and related sequences,\" Proc. IEEE, vol. 68, no. 5, pp. 593-\n619, May 1980.\n[14] S. W. Golomb and R. A. Scholtz, \"Generalized Barker sequences,\" IEEE\nTrans. Inform. Theory, vol. IT-11, no. 4, pp. 533-537, Oct. 1965.\n[15] D. G. Luenberger, \"On Barker codes of even length,\" Proc. IEEE, vol.\n51, pp. 230-231, Jan. 1963.\n[16] C. K. Chan and W. H. Lam, \"Generalised Barker-like PN sequences\nfor quasisynchronous spread spectrum multiple access communication\nsystems,\" IEE Proc. Commun., vol. 142, no. 2, pp. 91-98, April 1995.\n[17] X. Wang, Y. Wu and B. Caron, \"Transmitter identification using embedded\npseudo random sequences,\" IEEE Trans. Broadcasting, vol. 50, no.\n3, pp. 244-252, Sep. 2004.\n[18] V. Milosevic, V. Delic and V. Senk, \"Hadamard transform application\nin speech scrambling,\" Proc. IEEE, vol. 1, pp. 361-364, July 1997.\n[19] Tai-Kuo Woo, \"Orthogonal variable spreading codes for wideband\nCDMA,\" IEEE Trans. Vehicular Tech., vol. 51, no. 4, pp. 700-709, July\n2002.\n[20] B. Wysocki and T. A. Wysocki, \"Modified Walsh Hadamard\nsequences for DS-CDMA wireless systems,\" School of\nElectrical, Computer and Telecommunications Engineering,\nUniversity of Wollongong, Australia. (Online) Available:\nwww.elec.uow.edu.au/staff/wysocki/publications/J1.pdf.\n[21] A. Mitra, \"On Pseudo-Random and Orthogonal Binary Spreading Sequences\",\nto appear in Int. J. Info. Tech., 2007."]}