network profile
| bio | website | about:blank |
|---|---|---|
| location | Berlin, Germany | |
| age | 18 | |
| visits | member for | 1 year, 8 months |
| seen | Apr 21 at 18:39 | |
| stats | profile views | 1 |
I'm a highschool student from Germany interested in functional programming, especially Haskell.
|
Nov 18 |
awarded | Popular Question |
|
Aug 10 |
awarded | Nice Question |
|
May 8 |
awarded | Scholar |
|
May 8 |
accepted | Is there a simple hash function that one can compute without a computer? |
|
Nov 5 |
comment |
Is there a simple hash function that one can compute without a computer? Great idea! I like it, but first I have to Google all those terms. |
|
Nov 5 |
awarded | Supporter |
|
Sep 24 |
comment |
Is there a simple hash function that one can compute without a computer? If I had a trusted third party, the whole commitment scheme would be completely pointless. |
|
Sep 24 |
comment |
Is there a simple hash function that one can compute without a computer? This method is not good for my application (commitment schemes). If alice wants to get a collision, she could simply create an output by herself without having throwing a coin. |
|
Sep 24 |
comment |
Is there a simple hash function that one can compute without a computer? @e501 Good idea. Getting a lot of digits of $\rm e$ is not too difficult... But is it really safe of collisions? |
|
Sep 23 |
comment |
Is there a simple hash function that one can compute without a computer? Another thing would be squaring modulo somthing - solving this is NP-hard, but i doubt that it is impossible to find collisions. |
|
Sep 23 |
comment |
Is there a simple hash function that one can compute without a computer? I have an idea by myself: Could one use exponentiation modulo something as a hash function? |
|
Sep 23 |
awarded | Student |
|
Sep 23 |
asked | Is there a simple hash function that one can compute without a computer? |
|
Sep 23 |
awarded | Autobiographer |
