Uses of Interface gnu.javax.crypto.key.IKeyAgreementParty

Uses in package gnu.javax.crypto.key.srp6

Classes implementing gnu.javax.crypto.key.IKeyAgreementParty
class	SRP6Host The implementation of the Host in the SRP-6 key agreement protocol.
class	SRP6KeyAgreement The Secure Remote Password (SRP) key agreement protocol, also known as SRP-6, is designed by Thomas J.
class	SRP6SaslClient A variation of the SRP-6 protocol as used in the SASL-SRP mechanism, for the User (client side).
class	SRP6SaslServer A variation of the SRP-6 protocol as used in the SASL-SRP mechanism, for the Host (server side).
class	SRP6TLSClient A variation of the SRP6 key agreement protocol, for the client-side as proposed in Using SRP for TLS Authentication.
class	SRP6TLSServer A variation of the SRP6 key agreement protocol, for the server-side as proposed in Using SRP for TLS Authentication.
class	SRP6User The implementation of the User in the SRP-6 protocol.

Uses in package gnu.javax.crypto.key

Classes implementing gnu.javax.crypto.key.IKeyAgreementParty
class	BaseKeyAgreementParty A base abstract class to facilitate implementations of concrete key agreement protocol handlers.

Methods with return type gnu.javax.crypto.key.IKeyAgreementParty
IKeyAgreementParty	KeyAgreementFactory.getPartyAInstance(String name) Returns an instance of a key agreeent protocol handler, for party `A` in a two-party `A..B` exchange, given the canonical name of this protocol.
IKeyAgreementParty	KeyAgreementFactory.getPartyBInstance(String name) Returns an instance of a key agreeent protocol handler, for party `B` in a two-party `A..B` exchange, given the canonical name of this protocol.

Uses in package gnu.javax.crypto.key.dh

Classes implementing gnu.javax.crypto.key.IKeyAgreementParty
class	DiffieHellmanKeyAgreement The basic version of the Diffie-Hellman key agreement is described in the Handbook of Applied Cryptography [HAC] as follows: An appropriate prime p and generator g of Z_p^* (2 <= g <= p-2) are selected and published. A and B each send the other one message over an open channel; as a result, they both can then compute a shared secret key K which they can use to protect their future communication. A chooses a random secret x, 1 <= x <= p-2, and sends B message (1) which is g^x mod p. B chooses a random secret y, 1 <= y <= p-2, and sends A message (2) which is g^y mod p. B receives message (1) and computes the shared key as K = (g^x)^y mod p.
class	DiffieHellmanReceiver This implementation is the receiver's part of the basic version of the Diffie-Hellman key agreement exchange (B in [HAC]).
class	DiffieHellmanSender This implementation is the sender's part of the basic version of the Diffie-Hellman key agreement exchange (A in [HAC]).
class	ElGamalKeyAgreement The ElGamal key agreement, also known as the half-certified Diffie-Hellman key agreement, is described in the Handbook of Applied Cryptography [HAC] as follows: A sends to B a single message allowing one-pass key agreement. A obtains an authentic copy of B's public key (p, g, yb), where yb = gxb. A chooses a random integer x, 1 <= x <= p-2, and sends B the message gx.
class	ElGamalReceiver This implementation is the receiver's part of the ElGamal key agreement exchange (B in [HAC]).
class	ElGamalSender This implementation is the sender's part of the ElGamal key agreement exchange (A in [HAC]).