원문정보
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
In this paper, we propose a protocol to generate n2 keys in one session under the assumption of the intractability of the elliptic curve discrete logarithm problem and MQV protocol. Our protocol has the advantage of requiring less computing time compared with other protocols. Therefore, it is easy to apply in resource-constrained key agreement such as wireless sensor networks, mobile Ad-hoc networks, and cell phones which are severely constrained processor, battery, and memory.
목차
Abstract
1 Introduction
2 Elliptic Curve Cryptography Based on Group Theory
2.1 Elliptic Curve Discrete Logarithm Problem
2.2 Elliptic Diffie-Helman Key Exchange
3 Review Tseng’s Protocol
4 The Proposed Protocol
5 Security Analysis
6 Conclusions
References
1 Introduction
2 Elliptic Curve Cryptography Based on Group Theory
2.1 Elliptic Curve Discrete Logarithm Problem
2.2 Elliptic Diffie-Helman Key Exchange
3 Review Tseng’s Protocol
4 The Proposed Protocol
5 Security Analysis
6 Conclusions
References
키워드
저자정보
참고문헌
자료제공 : 네이버학술정보