论文信息 - An efficient key exchange protocol for cryptographically secure CDMA systems

An efficient key exchange protocol for cryptographically secure CDMA systems

This paper presents an efficient key exchange protocol for cryptographically secure CDMA systems which uses no more than the single REQUEST-RESPONSE protocol of conventional systems. The protocol, based on the Diffie-Hellman scheme, makes synchronisation of the cryptographic spreading sequence easy and uses the existing cryptographic sequence generation hardware for the key protocol computations.

[1] Simon J. Shepherd,et al. The Quadratic Residue Cipher and Some Notes on Implementation , 1993, Cryptologia.

[2] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[3] Correlation properties of a class of cryptographically secure spreading sequences , 1996, Proceedings of ISSSTA'95 International Symposium on Spread Spectrum Techniques and Applications.

[4] Vijay V. Vazirani,et al. Efficient and Secure Pseudo-Random Number Generation (Extended Abstract) , 1984, FOCS.

[5] Simon John Shepherd,et al. A Distributed Security Architecture for Large Scale Systems , 1992 .

[6] Adi Shamir,et al. On the generation of cryptographically strong pseudorandom sequences , 1981, TOCS.

[7] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[8] Jp McGeehan,et al. A Rigorous Evaluation of CDMA Techniques for Future European Personal Communication Systems , 1992 .

[9] Manuel Blum,et al. A Simple Unpredictable Pseudo-Random Number Generator , 1986, SIAM J. Comput..

[10] Donald Ervin Knuth,et al. The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .