Cryptographic hash functions from Markoff triples

Abstract: In this talk, we discuss how mod-$p$ Markoff graphs can be used to construct cryptographic hash functions. We present potential path finding algorithms in these graphs, which will also lead to questions about lifts of mod $p$ solutions to the Markoff equation will come up as well. This is joint work with M. Litman and A. Tran, as well as with E. Bellah and L. Ye.

number theory

Audience: researchers in the topic

Columbia CUNY NYU number theory seminar