<html><body><div style="height:1px;"></div>>Why is that more convenient for you? This is a long story: the our software analogue of JackPair project https://www.kickstarter.com/projects/620001568/jackpair-safeguard-your-phone-conversation (modem problems still delaying the release of hardware by AWIT team). We use another pseudo-voice modem for GSM compressed audio and have very slow duplexing data channel with hight BER and latency. Data transmitted by 32 bits blocks. ARQ is unused due hight latency. We optimize IKE for these conditions. The fastest way seems two-passes DH. Maybe I'm wrong and the usual way with commitment is optimal too, but I was interested in the theory. I do not know of such an approach for the two-step DH, and haven't seen any papers about it. I don't so familar with mathematics on the curves to prove the reliability or vulnerability. Maybe this way of DH has already been used and referred in papers. >but as the attacker can pick the first 224 bits they can probably find some class of points that speeds the search up. >(the attacker won't have a 100% chance for the attack, as there aren't 2^32 valid points in that space) Thank you, it's about what I expected to hear. >Just use the existing methods and then you don't need to worry about hypotheticals like the above. Another problem: what is the minimum bit length of the hash (commitment) is required for reliable verification by 32-bit short fingerprints of secret? Note: data transfer price is very high in our case. <blockquote class="xfmc1" style="border-left:1px solid rgb(204, 204, 204);margin:0px 0px 0px 0.8ex;padding-left:1ex;"> </blockquote> <img src="https://mail.ukr.net/api/public/message_read?a=gKmgv9dJOFKr1qfkfopsNCLgD9U7EMvkUFROc7rDIBGkeipIt5WL_vBmkaGOcFv9xXRtWaid46LYmeQ0bqNoi8uzMQ7Ot5mZdMJB0QNptw==" alt="" width="1" height="1" style="visibility: hidden; width: 1px; height: 1px;"/> </body></html>