Name
Abstract | ||
|---|---|---|
XTR is an excellent public key system that is suitable for variety of environments. XTR can achieve the same communication and security advantages at a much lower computational cost because of small keys and fast key selection. The computation of Sn(c) given c is an important algorithm in XTR. This paper suggests an improved algorithm to compute Sn(c). The new algorithm can improve the computational efficiency. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/MVHI.2010.139 | MVHI |
Keywords | Field | DocType |
subgroup,small key,computational efficiency,dh,important algorithm,ecc,xtr,key selection,lower computational cost,new algorithm,excellent public key system,improved algorithm,security advantage,arithmetic,computer science,public key cryptography,public key,galois fields,security,elliptic curve cryptography | Finite field,XTR,Computer science,Algorithm,Theoretical computer science,Elliptic curve cryptography,Public-key cryptography,Computation | Conference |
ISBN | Citations | PageRank |
978-1-4244-6596-5 | 0 | 0.34 |
References | Authors | |
1 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shiming Li | 1 | 0 | 0.68 |
| Guohui Zhou | 2 | 73 | 29.90 |
| Chunmao Jiang | 3 | 0 | 0.68 |
| Yan Zhao | 4 | 0 | 0.68 |
| Fengyu Lei | 5 | 4 | 2.12 |