Studies in Cryptological Combinatorics

Details Studies in Cryptological Combinatorics Studies in Cryptological Combinatorics

2004-11-24

arxiv.org/abs/math/0411531v1

Mathematics

Combinatorics

Scientific paper

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 1976. An approach to structuring key-agreement protocols via the use of one-way associative functions was proposed in 1993 by Rabi and Sherman. We propose here a provably strong associative one-way function based upon knot composition (answering an open problem proposed by Rabi and Sherman whether any such associative one-way functions exist). We also introduce and solve a game, exploring its relation to problems in graph and braid theory and develop a new technique for computing whether a graph is n-colorable. En route we look at estimator and prediction problems raised in Classical Probability Theory using Urn problems.

Affiliated with

Also associated with

No associations

Rating

Studies in Cryptological Combinatorics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Studies in Cryptological Combinatorics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Studies in Cryptological Combinatorics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-577144