A nit in section 5: "The security of Diffie-Hellman depends on the difficulty of the factoring problem”. More precisely, it depends on the difficulty of the modular discrete log problem, though it may be (I forgot if this is proven or a conjecture) that an efficient solution of that problem can be mapped to/from an efficient solution of the factoring problem.
paul On Oct 27, 2014, at 2:13 PM, Rodney Van Meter <[email protected]<mailto:[email protected]>> wrote: ... * We have just uploaded an -01 of the I-D we wrote, incorporating feedback from several people, including Sean Turner, Sheila Frankel and Alan Mink. http://datatracker.ietf.org/doc/draft-nagayama-ipsecme-ipsec-with-qkd/?include_text=1
_______________________________________________ IPsec mailing list [email protected] https://www.ietf.org/mailman/listinfo/ipsec
