• 한국항공운항학회지
• /
• 제15권1호
• /
• pp.11-17
• /
• 2007

One of the key elements for developing GNSS (Global Navigation Satellite Systems) is the comprehensive analysis of GNSS satellite orbit including the capabilities to generate precision navigation message. The orbit characteristics of Japan's own GNSS system, called QZSS (Quasi Zenith Satellite System) is analyzed and its navigation message, which includes orbit elements and correction terms, is investigated. QZSS-type orbit simulations were performed using a precision orbit integrator in order to analyze the effect of perturbation forces, e.g. gravity, Moon, Sun, etc., on the orbit variation. A preliminary algorithm for creating orbit element corrections was developed and its accuracy is evaluated with the simulation data.

• 융합정보논문지
• /
• 제7권6호
• /
• pp.97-102
• /
• 2017

본 논문에서는 연구목적과 관련하여, 협업 지능형교통체계와 자율주행체계에 관심을 가지고 있으며, C-ITS 특성 가운데 핵심 전달 메시지인 CAM과 DENM 특성 분석, 또한 V2X 통신의 보안 특성과 함께 CAM 및 DENM 메시지의 보안 인증서 및 헤더 구조를 중심으로 분석에 초점을 맞추고 있다. 연구방법에 대해, 우리는 CAM 메시지인 차량의 위치와 상태를 알리는 메시지를 분석하고, DENM 메시지인 차량 사고와 같은 이벤트를 알리는 메시지를 분석하고, 이를 지원하는 보안통신 특성을 분석한다. 차량통신에 사용하는 보안헤더와 인증서 형식과 함께, 차량용 서명된 인증서 검증 절차, 그리고 차량용PKI 특성을 얻었다. 아울러, V2X 보안통신을 위해 필요로 하는 보안 동기패턴에 대한 특성과 전송능력에 대해서도 함께 유도할 수 있었다. 그러므로 본 논문은 C-ITS 환경에서 DENM 및 CAM을 전송하는 통신 서비스를 위한 보안 특성을 고려할 때 의미 있는 결과라 할 수 있다.

• 정보보호학회논문지
• /
• 제14권2호
• /
• pp.15-22
• /
• 2004

위수가 q인 생성원 g를 사용하는 ElGamal형 서명기법에서는 서명되어질 각 문서마다 message nonce를 구간(0, q-1)에서 랜덤하게 선택해야 한다는 것은 잘 알려진 사실이다. H. Kuwakado와 H. Tanaka는 사용된 message nonce가 각각 0＜$textsc{k}$$_1$, $textsc{k}$$_2$$\leq$Ο(equation omitted)인 서명 두 개가 주어졌을 때, 서명자의 비밀키를 다항식 시간으로 계산해내는 알고리즘을 제안하였다. 최근 R. Gallant, R. Lambert, S. Vanstone등은 정수를 적절히 분해하여 타원곡선암호의 효율성을 개선하는 방법을 제안하였다. 이 논문에서는 타원곡선암호의 고속연산에서 사용되었던 정수의 분해기법을 Kuwakado등의 알고리즘에 적용하여 message nonce가 ｜$textsc{k}$$_1$｜, ｜$textsc{k}$$_2$｜인 경우에도 적용할 수 있도록 확장하고, 알고리즘의 효율성 및 공격의 완성도를 개선하였다.

• 한국통신학회논문지
• /
• 제27권3C호
• /
• pp.220-225
• /
• 2002

본 논문은 Mobile IP의 보안적인 측면에 대해 다룬다. 인증 기법과 재생공격 방지 기법을 사용함에도 불구하고 재생공격이 여전히 일어남을 보여주고 이를 해결하기 위해 공개키를 이용한 AAA에서의 새로운 등록방법과 세션키 분배 방법을 제안한다. 제안된 프로토콜은 이동노드의 인증이 완료됨과 동시에 session-key의 분배가 이루어지도록 설계하였다. 또한 공개키 시스템을 최소한으로 사용하여 재생공격의 문제점을 해결하였고 이동노드에서 최소의 계산량을 요구하도록 설계하였다. AAA에서의 정확한 accounting이 가능하도록 부인방지 기능도 추가하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 I
• /
• pp.113-116
• /
• 2003

Mobile communication network because information through radio channel is passed, information may be eavesdropped and need information security countermeasure in communication network dimension for safe information exchange because there is possibility that is manufactured. This paper used Public Key Cryptography for protection and authentication connected with user authentication. Use public key and private key that is asymmetry encryption key to quote that is used at encryption, decryption of Public key. Encrypt IMSI and authentication message that is transmitted MS, VLR and HLR interval to public key, wish to embody transmitted authentication protocol safety.

• Journal of Communications and Networks
• /
• 제10권1호
• /
• pp.10-17
• /
• 2008

In traditional digital signature schemes, certificates signed by a trusted party are required to ensure the authenticity of the public key. In Asiacrypt 2003, the concept of certificateless signature scheme was introduced. The advantage of certificateless public key cryptography successfully eliminates the necessity of certificates in the traditional public key cryptography and simultaneously solves the inherent key escrow problem suffered in identity-based cryptography. Recently, Yap et al. proposed an efficient certificateless signature scheme and claimed that their scheme is existentially unforgeable in the random oracle model. In this paper, we show that the certificateless signature scheme proposed by Yap et al. is insecure against public key replacement attacks. Furthermore, we propose an improved certificateless signature scheme, which is existentially unforgeable against adaptive chosen message attacks under the computational Diffie-Hellman assumption in the random oracle model and provide the security proof of the proposed scheme.

• 중소기업융합학회논문지
• /
• 제4권3호
• /
• pp.21-25
• /
• 2014

Group communications are becoming popular in Internet applications such as video conferences, on-line chatting programs, games, and gambling. Secure and efficient group communication is needed for message integration, confidentiality, and system usability. However, the conventional group key agreement protocols are too much focused on minimizing the computational overhead by concentrating on generating the common group key efficiently for secure communication. As a result, the common group key is generated efficiently but a failure in authentication allows adversaries to obtain valuable information during the group communication. After achieving the secure group communication, the secure group communication should generate the group key efficiently and distribute it to group members securely, so the balance of security and system usage must be considered at the same time. Therefore, this research proposes the software architecture model of a secure and efficient group communication that will be imbedded into networking applications.

• 정보통신설비학회논문지
• /
• 제8권2호
• /
• pp.64-71
• /
• 2009

In this paper, This thesis is cell phone for make CAS service be for hand joining broadcasting Create a way CAS Chip. PerSam issue card inside use Seed Key and algorithm make CID Key and record CAS Chip. PerSam member Card inside use Seed Key and algorithm make Subscriber Key after include Subscriber. Key CAS Chip for record CID Key register EMM. make CAS CHIP in accordance with issue CAS Chip. broadcast service entry be for hand treatment so make low bandwidth for joining massage and make increase a member.

• Journal of information and communication convergence engineering
• /
• 제20권4호
• /
• pp.242-249
• /
• 2022

Classical cryptography with complex computations has recently been utilized in the latest computing systems to create secret keys. However, systems can be breached by fast-measuring methods of the secret key; this approach does not offer adequate protection when depending on the computational complexity alone. The laws of physics for communication purposes are used in quantum computing, enabling new computing concepts to be introduced, particularly in cryptography and key distribution. This paper proposes a quantum computing lattice (CQL) mechanism that applies the BB84 protocol to generate a quantum key. The generated key and a one-time pad encryption method are used to encrypt the message. Then Babai's algorithm is applied to the ciphertext to find the closet vector problem within the lattice. As a result, quantum computing concepts are used with classical encryption methods to find the closet vector problem in a lattice, providing strength encryption to generate the key. The proposed approach is demonstrated a high calculation speed when using quantum computing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권8호
• /
• pp.2042-2060
• /
• 2013

In wireless sensor networks (WSNs), energy efficiency is one of the most essential design considerations, since sensor nodes are resource constrained. Group communication can reduce WSNs communication overhead by sending a message to multiple nodes in one packet. In this paper, in order to simultaneously resolve the transmission security and scalability in WSNs group communications, we propose a hierarchical cluster-based secure and scalable group key management scheme, called HRKT, based on logic key tree and route key tree structure. The HRKT scheme divides the group key into cluster head key and cluster key. The cluster head generates a route key tree according to the route topology of the cluster. This hierarchical key structure facilitates local secure communications taking advantage of the fact that the nodes at a contiguous place usually communicate with each other more frequently. In HRKT scheme, the key updates are confined in a cluster, so the cost of the key updates is reduced efficiently, especially in the case of massive membership changes. The security analysis shows that the HRKT scheme meets the requirements of group communication. In addition, performance simulation results also demonstrate its efficiency in terms of low storage and flexibility when membership changes massively.