Complexity Assumptions. Let G be a cyclic additive group generated by point P, whose order is a prime q. We review the following well-known problems to be used in the security analysis of our scheme.
Appears in 2 contracts
Sources: Remote User Authentication and Key Agreement Scheme, Authentication and Key Agreement Scheme