Name
Abstract | ||
|---|---|---|
We propose an n-round key agreement protocol for any N-participants, where 3^n^-^1 |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.amc.2004.08.011 | Applied Mathematics and Computation |
Keywords | Field | DocType |
n-round key agreement protocol,group key agreement protocol,diffie hellman,key agreement protocol,divide and conquer | Group key,Station-to-Station protocol,Discrete mathematics,Elliptic curve Diffie–Hellman,Group key agreement protocol,Elliptic curve cryptosystem,Key-agreement protocol,Bilinear diffie hellman problem,Mathematics,Diffie–Hellman problem | Journal |
Volume | Issue | ISSN |
167 | 2 | Applied Mathematics and Computation |
Citations | PageRank | References |
4 | 0.49 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Iwan M. Duursma | 1 | 279 | 26.85 |
| Hyang-Sook Lee | 2 | 261 | 21.43 |