Design of the Covered Address Generation using the Super Increasing Sequence in Wireless Networks

무선 네트워크에서의 초증가 수열을 통한 주소 은닉 기법 설계

  • 천준호 (숭실대학교 대학원 컴퓨터학과) ;
  • 김성찬 (숭실대학교 대학원 컴퓨터학과) ;
  • 장근원 (숭실대학교 일반대학원 컴퓨터학과) ;
  • 도경화 (산자부 정보보안기술(JTC1/SC27) 전문위원회) ;
  • 전문석 (숭실대학교 IT 대학)
  • Published : 2007.08.31


The General security method of wireless network provides a confidentiality of communication contents based on the cryptographic stability against a malicious host. However, this method exposes the logical and physical addresses of both sender and receiver, so transmission volume and identification of both may be exposed although concealing that content. Covered address scheme that this paper proposes generates an address to which knapsack problem using super increasing sequence is applied, and replaces the addresses of sender and receiver with addresses from super increasing sequence. Also, proposed method changes frequently secret addresses, so a malicious user cannot watch a target system or try to attack the specific host. Proposed method also changes continuously a host address that attacker takes aim at. Accordingly, an attacker who tries to use DDoS attack cannot decide the specific target system.


  1. Leonard M. Adleman. On Breaking Generalized Knapsack Public Key Cryptosystems, In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing. ACM, New York. 1983, pp.402-412
  2. Gilles Brassard. A Note on the Complexity of Cryptography. IEEE Transactions on Information Theory, vol. IT-25, 1979, pp.232-233
  3. A. A. Pirzada and C. McDonald, 'Establishing trust in pure ad-hoc networks,' Proceedings of the 27th Australasian Computer Science Conference (ACSC), vol. 26, no. 1, pp.47.54, 2004
  4. M. G. Zapata, 'Secure ad hoc on-demand distance vector (saodv) routing,' IETF MANET, Internet Draft (work in progress), 2001
  5. K. Wrona, 'Distributed security: Ad hoc networks & beyond,' in Proceedings of the Pampas Workshop 02, September 2002
  6. Y.-C. Hu and A. Perrig, 'A survey of secure wireless ad hoc routing,' IEEE Security & Privacy, vol. 4, pp.28.39, May/June 2004
  7. P. Papadimitratos and Z. Haas, 'Secure routing for mobile ad hoc networks,' in SCS Communication Networks and Distributed Systems Modeling and Simulation Conference, January 2002, pp.27.31
  8. B. Preneel, Lectures on Data Security: Modem Cryptology in Theory and Practice. Heidelberg: Springer-Verlag, 1999, vol. 1561, ch. The State of Cryptographic Hash Functions, pp.158.182
  9. 11.R.L.Rivest.RFC 1321 : The MD5 Message-Digest Algorithm, April 1992
  10. T. Okamoto and S. Uchiyama, 'A new public-key cryptosystem as secure as factoring', in Advances in Cryptology - EUROCRYPT'98, ed. K. Nyberg, LNCS 1403, Berlin: Springer-Verlag, pp.308- 318, 1998
  11. Guangjie Liu, Yuewei Dai, Zhiquan Wang, 'Breaking Predictive-Coding-Based Steganography and Modification for Enhanced Security,' International Journal of Computer Science and Network Security, Vol. 6 No.3, pp.144-149, 2006.03