Timeline for Using High Level Probability Theory (eg Markov Chain Mixing) in Cryptography/Cryptanalysis
Current License: CC BY-SA 3.0
4 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Oct 4, 2018 at 8:28 | comment | added | Sam OT | Thank you again for these links. I found them very interesting. I looked at them at the time, but it now turns out that my research may have an implication similar to in these papers, so I looked in more details. I wasn't able to fully understand some of the motivation and statements, though. I was wondering if you are knowledgeable in this field, or if it just happened that you knew these papers? | |
Feb 15, 2017 at 14:21 | comment | added | Carlo Beenakker | yep, same Morris; you may find this NSF page helpful: nsf.gov/awardsearch/showAward?AWD_ID=1007739 | |
Feb 15, 2017 at 13:49 | comment | added | Sam OT | Ooh, very interesting, thank you. I assume this is the same Morris who developed Evolving Sets with Yuval Peres? (His homepage isn't that helpful... math.ucdavis.edu/~morris) The work on mixing that I'm doing uses this process (along with the related Diaconis/Fill coupling) fundamentally! | |
Feb 15, 2017 at 13:33 | history | answered | Carlo Beenakker | CC BY-SA 3.0 |