Papers
Topics
Authors
Recent
Search
2000 character limit reached

The key exchange cryptosystem used with higher order Diophantine equations

Published 19 Mar 2011 in cs.IT and math.IT | (1103.3742v1)

Abstract: One-way functions are widely used for encrypting the secret in public key cryptography, although they are regarded as plausibly one-way but have not been proven so. Here we discuss the public key cryptosystem based on the system of higher order Diophantine equations. In this system those Diophantine equations are used as public keys for sender and recipient, and sender can recover the secret from the Diophantine equation returned from recipient with a trapdoor. In general the system of Diophantine equations is hard to solve when it is positive-dimensional and it implies the Diophantine equations in this cryptosystem works as a possible one-way function. We also discuss some problems on implementation, which are caused from additional complexity necessary for constructing Diophantine equations in order to prevent from attacking by tamperers.

Citations (18)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.