<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40"><head><meta http-equiv=Content-Type content="text/html; charset=utf-8"><meta name=Generator content="Microsoft Word 15 (filtered medium)"><style></style></head><body lang=DE link=blue vlink=purple><div class=WordSection1>Hi Björn,<o:p></o:p><o:p> </o:p>Thank you for your prompt reply. Actually your paper is one of the sources I’ve been reading the past days. We’ll certainly consider the suggestions you have made. In fact, the hash could incorporate a random session ID (as I understood there is an attack against SPEKE where you create multiple concurrent sessions), but those are separate concerns – and therefore I was referring to a random base point.<o:p></o:p><o:p> </o:p>Your note about an ephemeral generator is apparently also orthogonal, right?<o:p></o:p><o:p> </o:p>So to better understand your point, if for example the hash of the password has n bits of effective security, say 128, then we would leak one bit of the hash (not the password itself), correct? Put differently, how could this information practically be exploited? Is it a realistic attack today or e.g. a potential weakness that could be attacked using a quantum computer and a nuclear power plant in e.g. 20 years from now?<o:p></o:p><o:p> </o:p>The question is, whether or not added code space, execution time and battery drain for eliigator2 are worth it, for our particular use case. Or would you consider the additional complexity negligible compared to X25519. For example on a Cortex-M4 (ATSAM4S8B) the scalar product requires 4kB flash and roughly 1.8M cycles using Wouter de Groot’s implementation. What would elligator2 add to this, assuming an implementation of similar quality – or even reusing the field primitives already present (as far as possible)?<o:p></o:p><o:p> </o:p>Thanks again<o:p></o:p><o:p> </o:p>Arasch<o:p></o:p><o:p> </o:p><div><div style='border:none;border-top:solid #E1E1E1 1.0pt;padding:3.0pt 0cm 0cm 0cm'>Von: Curves [mailto:curves-bounces@moderncrypto.org] Im Auftrag von "Björn Haase" Gesendet: Dienstag, 24. Oktober 2017 17:17 An: curves@moderncrypto.org Betreff: [curves] Fw: Aw: SPEKE using Curve25519 - elligator2 required or recommended?<o:p></o:p></div></div><o:p> </o:p><div><div><div>Hi,<o:p></o:p></div><div> <o:p></o:p></div><div name=quoted-content><div>first of all, I agree that using a PAKE scheme for password-based authentication on zigbee networks is a good idea. Also, SPEKE-based protocols are IMHO the fastest choice available. Since SPEKE patents have expired, there is no need to avoid that the password itself enters the calculation of the generator, which was (IIUC) the main reason for the patent circumvention approach for that PACE has been developped.<o:p></o:p></div><div> <o:p></o:p></div><div>Regarding the base point selection, I'd strongly recommend to use Elligator2 and not just the hash of the password. The reason is, that depending on your construction, you will at least leak one bit of the password. If you just use the hash, you will either be having a point on the curve or on it's twist and this information could be exploited. IMO there are a couple of things to consider when suggesting standardization: I'd recommend to combine the construction with use of a sound password hash, such as scrypt or argon2, mainly because it's likely that you will never enter the password on the small node. At least one should use PBKDF2 with a strong parameter set. The second thing is consideration of side-channel stuff. I'd advocate on using an ephemeral generator. This costs essentially one additional communication round, but this might be worth the effort, since you anyway might be having a communication telegram exchange before the actual PAKE scheme. When combining some ephemeral (and publicly known) random with the password hash for generating an ephemeral generator with Elligator2, you will be ending up with something very similar to our PACE paper at chess (<a href="https://eprint.iacr.org/2017/562.pdf" target="_blank">https://eprint.iacr.org/2017/562.pdf</a>). Note that the fact that you are using an ephemeral generator comes virtually at no added cost. I'd suggest to use a permutation or a hash for combining random values from both sides, and the password hash and feed the result into elligator2 to get an ephemeral generator. The patent circumvention step in our PACE paper (that forced us to use a symmetric cipher, in our case Salsa20, on top) is now no longer necessary. Yours, Björn<o:p></o:p></div><div style='border:none;border-left:solid #C3D9E5 1.5pt;padding:0cm 0cm 0cm 8.0pt;margin-left:7.5pt;margin-top:7.5pt;margin-right:3.75pt;margin-bottom:3.75pt'><div style='margin-bottom:7.5pt'>Gesendet: Dienstag, 24. Oktober 2017 um 14:03 Uhr Von: "Arasch Honarbacht" <<a href="mailto:honarbacht@ubisys.de">honarbacht@ubisys.de</a>> An: <a href="mailto:curves@moderncrypto.org">curves@moderncrypto.org</a> Betreff: [curves] SPEKE using Curve25519 - elligator2 required or recommended?<o:p></o:p></div><div><div><div>Hi all,<o:p></o:p> <o:p></o:p>I’m working on a proposal for key agreement in zigbee networks. The idea is to use SPEKE and Curve25519. My understanding is that Curve25519 accepts all 32-byte strings as valid public keys. Now, instead of the default base point 9, the base point is generated using a hash of the password. For argument’s sake, assume the base point would be a random number. I’ve implemented a test bench and tested this approach and it works well (for the small set of experiments I made, i.e. a couple of thousand executions).<o:p></o:p> <o:p></o:p>The approach as it stands:<o:p></o:p> <o:p></o:p>Alice generates a secret a, Bob generates a secret b.<o:p></o:p>Alice computes P = aG and sends it to Bob. Bob computes Q = bG and sends it to Alice.<o:p></o:p>Alice computes k = aQ = abG. Bob computes k = bP = baG.<o:p></o:p> <o:p></o:p>When the base point G is chosen as one of the 12 points listed under the “contributory” behavior on Bernstein’s site (<a href="https://cr.yp.to/ecdh.html" target="_blank">https://cr.yp.to/ecdh.html</a>) the scalar products P and Q and the shared secret become zero – so these points need to be avoided.<o:p></o:p> <o:p></o:p>Now, I saw in literature that reverse elligator2 mapping is used to map a random string to a Montgomery x coordinate u, e.g. instead of G simply being the hash, G = elligator2(hash), c.f. Figure 1 in this paper: <a href="https://eprint.iacr.org/2017/562.pdf" target="_blank">https://eprint.iacr.org/2017/562.pdf</a>, or section 2.6 here: <a href="https://signal.org/docs/specifications/xeddsa/" target="_blank">https://signal.org/docs/specifications/xeddsa/</a>.<o:p></o:p> <o:p></o:p>My question is: Would a elligator2 mapping be required for the SPEKE use case outlined above, or is any point, except for the 12 points mentioned above suitable as a generator?<o:p></o:p> <o:p></o:p>Thanks, Arasch<o:p></o:p></div>_______________________________________________ Curves mailing list <a href="mailto:Curves@moderncrypto.org">Curves@moderncrypto.org</a> <a href="https://moderncrypto.org/mailman/listinfo/curves" target="_blank">https://moderncrypto.org/mailman/listinfo/curves</a><o:p></o:p></div></div></div></div></div></div></div></body></html>