Re: Authentication
From: Thomas Wu (tjw_at_xenon.Stanford.EDU)
Date: 01/19/05
- Next message: Joe Peschel: "Re: Singular they [was Re: [Lit.] Buffer overruns]"
- Previous message: jstevh_at_msn.com: "Factoring problem, solved"
- In reply to: K-Stern_at_neiu.edu: "Re: Authentication"
- Next in thread: Erland: "Re: Authentication"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 18 Jan 2005 20:47:03 -0800
K-Stern@neiu.edu writes:
> I have modified what the original poster came up with and I believe
> that I have increased the security.
>
> Per DH:
>
> A and B agree upon a large prime n and a primitive root within the
> field Z_n, g.
>
> A generates a random number, a, < n and calculates A_public = g^a (mod
> n)
>
> B generates a random number, b, < n and calculates B_public = g^b (mod
> n)
>
> A uses the password to encrypt A_public and sends this to B.
>
> B uses the password to encrypt B_public and sends this to A.
Isn't this exactly the DH flavor of EKE?
Tom
-- Tom Wu http://www-cs-students.stanford.edu/~tjw/
- Next message: Joe Peschel: "Re: Singular they [was Re: [Lit.] Buffer overruns]"
- Previous message: jstevh_at_msn.com: "Factoring problem, solved"
- In reply to: K-Stern_at_neiu.edu: "Re: Authentication"
- Next in thread: Erland: "Re: Authentication"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|