[HN Gopher] A new rare high-rank elliptic curve, and an orchard ...
___________________________________________________________________
A new rare high-rank elliptic curve, and an orchard of Diophantine
equations
Author : mathgenius
Score : 102 points
Date : 2024-09-07 17:43 UTC (5 hours ago)
(HTM) web link (thehighergeometer.wordpress.com)
(TXT) w3m dump (thehighergeometer.wordpress.com)
| miovoid wrote:
| [deleted]
| madars wrote:
| Your E/Fp has order 2^3 * 3 * 37991 * 21183269 * 373015308871 *
| 16071902378831708724506232718210977087913221837027589 and thus
| you can't hope for more than 86 bits of security due to Pohlig-
| Hellman, never mind cofactor attacks. encrypt() is also
| insecure (xor every byte of the message with the same shared
| secret byte), even if you chose a better curve.
| tptacek wrote:
| This is much better version of the sibling comment but I'm a
| message board nerd and can't keep myself from pointing out
| that this code is probably a little bit tongue-in-cheek.
| leijurv wrote:
| `for char in message: encrypted_char = ord(char) ^
| (shared_secret[0] % 256)`
|
| This is not real encryption, it picks only one byte of shared
| secret and XORs it into the plaintext. Therefore, there are
| only 256 possible decryption keys to check, which is trivial.
|
| Instead, you'd want to use the shared secret as a key to
| something strong and symmetric like AES.
| tptacek wrote:
| I don't think it's meant to be real encryption.
| leijurv wrote:
| I suspect it was, given that they've now deleted their
| comment.
| thechao wrote:
| Any idiot knows not to use power-of-two! You gotta use "+13",
| which is prime and, therefore, *secure*.
| Uptrenda wrote:
| VITALIK, get your ass in here and tell us what this means.
___________________________________________________________________
(page generated 2024-09-07 23:00 UTC)