Timeline for Simple: Hash Into a Prime Field
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 24 at 16:55 | comment | added | poncho | @n-l-i: true, rejection sampling does work (but takes variable time - sometimes that's important and sometimes it's not). However, there is one correction to your comment: the question wasn't "how do I hash into a 300 bit prime", instead, it was "how do I hash into a value within a prime field" (that is, some value in $[0, p)$, where $GF(p)$ is the field we're hashing into); hence the primality testing is irrelevant. | |
| May 24 at 16:11 | comment | added | n-l-i | It is possible to hash the message into a prime smaller than 2^300. If you keep 300 bits of the hash and calculate new hash values until you stumble upon a prime. There will be no bias that way, assuming the underlaying hash function has no perceivable bias. | |
| Mar 7, 2020 at 13:39 | vote | accept | Erik Aronesty | ||
| Mar 5, 2020 at 19:12 | history | answered | poncho | CC BY-SA 4.0 |