Authenticated key agreement without subgroup element verification

Research output: Contribution to journalConference articlepeer-review


In this paper, we rethink the security of authenticated key agreement and describe a simple protocol from the practical perspective. Our main focus is on reconsidering the need for real-time checking of random exchange to be in a proper subgroup, and on embedding identity assurance into implicitly authenticated keys. In spite that the result of this paper is not novel at present, it might be worth discussing the implication of authenticated key agreement not requiring extra computations or message blocks in run time. Trivial range checking is to be sufficient.

Original languageEnglish
Pages (from-to)577-583
Number of pages7
JournalLecture Notes in Computer Science
Issue numberI
Publication statusPublished - 2005
EventInternational Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore
Duration: 2005 May 92005 May 12

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Authenticated key agreement without subgroup element verification'. Together they form a unique fingerprint.

Cite this