@kelalaka From "Supersingular isogeny key exchange for beginners" (Craig Costello 2019)

@corpsfini Because ker([4]) ≅ Z4×Z4 , which leads to 5 subgroup of order 4. So these 5 cyclic groups have generator Pi, and [2]Pi is an order 2 point. So there is 5. Can you give me the way how you count this?

Really really thanks for your help poncho, you are knowledgeable and helpful.

Thanks a lot for your patient explanation poncho. So what you're saying is that we're skeptical, but at the same time we can't strictly say that chaos-based cryptography is not quantum-resistant, in my opinion, because we still do not understand chaos systems well enough right?

Thanks for the links kodlu, widely used I mean I have seen a large amount of literature on this topic,sorry about my poor english. But I indeed do not know that whether chaos based cryptography is publicly accepted in practical. So the reason of lacking rigorous proof is what? Complexity or something else?

But chaos based cryptography algorithms are already widely used I think, can you share your reason or your opinion on this?