Timeline for Publishing mathematical coincidences
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 8 at 21:59 | history | made wiki | Post Made Community Wiki by Ben Webster♦ | ||
| Jun 19, 2018 at 0:35 | comment | added | Fan Zheng | This looks like an instance of the Birthday Paradox (en.wikipedia.org/wiki/Birthday_problem#Square_approximation). | |
| Nov 6, 2017 at 21:39 | comment | added | Carlo Beenakker | @user2357112 --- point taken, I have added the description from the linked paper, to avoid any misunderstanding. Thank you for the feedback. | |
| Nov 6, 2017 at 21:38 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
added 633 characters in body
|
| Nov 6, 2017 at 21:11 | comment | added | user2357112 | This answer seems like a misleading description of the results of the linked paper. This answer makes it sound like just trying that many formulas produces that level of accuracy, when the actual procedure requires a more sophisticated meet-in-the-middle attack. Just naively trying formulas would require closer to O(10^p) tries. | |
| Nov 6, 2017 at 16:20 | comment | added | R.. GitHub STOP HELPING ICE | Yes, that was the name I was reaching for but couldn't remember. | |
| Nov 6, 2017 at 6:20 | comment | added | Wojowu | @R.. I suppose this has to do with the nothing up my sleeve numbers? | |
| Nov 5, 2017 at 17:18 | comment | added | R.. GitHub STOP HELPING ICE | Far from being a toy subject, this type of issue is actually of critical importance in design of cryptography, where it turns out it's easy to construct "natural looking" constants that are actually parameters for weakening or backdooring a system. | |
| Nov 5, 2017 at 13:38 | history | answered | Carlo Beenakker | CC BY-SA 3.0 |