Simplified authenticated key exchange based on the q(th) root problem [electronic resource]
Finding a q{sup th} root in GF(p), where p and q are prunes, q is large and q² divides (p-1) is a difficult problem equivalent to the discrete logarithm problem using an element of order q as the base. This paper describes an authenticated key exchange algorithm utilizing this hard problem.
Saved in:
| Online Access: |
Online Access |
|---|---|
| Corporate Author: | |
| Format: | Government Document Electronic eBook |
| Language: | English |
| Published: |
Washington, D.C : Oak Ridge, Tenn. :
United States. Dept. of Energy ; distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy,
2000.
|
| Subjects: |
Internet
Online AccessOnline
| Call Number: |
E 1.99:sand2000-0513j
|
|---|---|
| E 1.99:sand2000-0513j | Available |