The Kunerth's algorithm is a non generic modular square root algorithm that compute modular square roots without factoring the modulus…

Let’s say I’ve a valid input for which the algorithm can return a solution, is it possible to tweak it so that it returns a different possible solution ? So far I only found how to modify it to return the modular inverse… — Preceding unsigned comment added by 2A01:E0A:401:A7C0:9D9:50BB:6262:E787 (talk) 06:39, 18 January 2025 (UTC)[reply]

This question has also been asked (and answered) at User talk:Endo999 § A question about Kunerth’s algorithm….

Being unfamiliar with Kunerth's algorithm I tried to understand it from our article, but the presentation is so confusing (also in the Example section) that I kept getting lost.  --Lambiam 09:21, 18 January 2025 (UTC)[reply]

Personally, I used this implementation to understand it. As the article do contains errors, my question is merely how to modify the implementation in order to get a different valid ouput for the same input 2A01:E0A:401:A7C0:9D9:50BB:6262:E787 (talk) 14:15, 18 January 2025 (UTC)[reply]

Regarding the answer I received on the other page, it seems to me the author doesn’t fully understand the algorithm. 2A01:E0A:401:A7C0:416E:83F1:C73F:88BD (talk) 12:46, 20 January 2025 (UTC)[reply]