• Title/Summary/Keyword: Super Increasing Sequence

Search Result 3, Processing Time 0.112 seconds

Design of the Covered Address Generation using the Super Increasing Sequence in Wireless Networks (무선 네트워크에서의 초증가 수열을 통한 주소 은닉 기법 설계)

  • Choun, Jun-Ho;Kim, Sung-Chan;Jang, Kun-Won;Do, Kyung-Hwa;Jun, Moon-Seog
    • The KIPS Transactions:PartC
    • /
    • v.14C no.5
    • /
    • pp.411-416
    • /
    • 2007
  • 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.

A Generalized Subtractive Algorithm for Subset Sum Problem (부분집합 합 문제의 일반화된 감산 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.2
    • /
    • pp.9-14
    • /
    • 2022
  • This paper presents a subset sum problem (SSP) algorithm which takes the time complexity of O(nlogn). The SSP can be classified into either super-increasing sequence or random sequence depending on the element of Set S. Additive algorithm that runs in O(nlogn) has already been proposed to and utilized for the super-increasing sequence SSP, but exhaustive Brute-Force method with time complexity of O(n2n) remains as the only viable algorithm for the random sequence SSP, which is thus considered NP-complete. The proposed subtractive algorithm basically selects a subset S comprised of values lower than target value t, then sets the subset sum less the target value as the Residual r, only to remove from S the maximum value among those lower than t. When tested on various super-increasing and random sequence SSPs, the algorithm has obtained optimal solutions running less than the cardinality of S. It can therefore be used as a general algorithm for the SSP.

Design of Covered Rout ing Protocol using Super Increasing Sequence and Knapsack Algorithm in MANET (초증가 수열과 Knapsack 알고리즘을 이용한 MANET에서의 은닉 라우팅 프로토콜 설계)

  • Choun Junho;Park Jaesung;Lee Sanghun;Jang Kun-Won;Jun Munseog
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.67-69
    • /
    • 2005
  • 현재까지의 보안 라우팅 프로토콜은 유무선에 관계 없이 페이로드 부분은 암호화가 되더라도 패킷 헤더의 내용이 평문 형태로 무방비하게 노출되며 라우팅 경로가 안전하게 보장되더라도 악의적인 노드에게 경로가 알려지는 것을 차단 할 수 없다. 또한 유선 환경과는 달리 Ad-hoc 네트워크와 같은 무선 상황에서는 전파의 전방향성 때문에 송수신 범위 내에 있는 노드들이 평문 형태의 라우팅 정보 및 송수신 노드의 정보를 수집하는 것을 방지 할 수 없다. 본 논문에서 제안하는 은닉 라우팅 프로토콜은 한쌍의 노드가 비대칭키 암호화 알고리즘을 통해 공유한 초증가 수열을 통해 송수신 노드를 은닉하면서도 정당한 수신 노드만 자신이 수신 노드임을 알 수 있는 기법을 제공함으로서 악의적인 노드가 라우팅 경로에 대한 정보를 수집하는 것을 원천적으로 차단한다.

  • PDF