3 citations · 5 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2004★ 2 cited
Studies in Cryptological Combinatorics
Marc Zucker
The key-agreement problem (finding a private key to use for secret messages, otherwise referred to as the public-key distribution problem), was introduced by Diffie and Hellman in…
math.CO2003★ 3 cited
Motions on n-Simplex Graphs with m-value memory
Marc Zucker
We introduce the idea of an n-simplex graph and games upon simplicial complexes. We then define moves on a labeled graph and pose the problem of whether given two labelings of a gr…