Loading AI tools
From Wikipedia, the free encyclopedia
The Okamoto–Uchiyama cryptosystem is a public key cryptosystem proposed in 1998 by Tatsuaki Okamoto and Shigenori Uchiyama. The system works in the multiplicative group of integers modulo n, , where n is of the form p2q and p and q are large primes.
Let be an odd prime. Define . is a subgroup of with (the elements of are ).
Define by
is a homomorphism between and the additive group : that is, . Since is bijective, it is an isomorphism.
One can now show the following as a corollary:
Let such that and for . Then
The corollary is a direct consequence of .
Like many public key cryptosystems, this scheme works in the group . This scheme is homomorphic and hence malleable.
A public/private key pair is generated as follows:
The public key is then and the private key is .
A message can be encrypted with the public key as follows.
The value is the encryption of .
An encrypted message can be decrypted with the private key as follows.
The value is the decryption of .
Let and . Then . Select . Then .
Now to encrypt a message , we pick a random and compute .
To decrypt the message 43, we compute
And finally .
We wish to prove that the value computed in the last decryption step, , is equal to the original message . We have
So to recover we need to take the discrete logarithm with base . This can be done by applying , as follows.
By Fermat's little theorem, . Since one can write with . Then and the corollary from earlier applies: .
Inverting the encryption function can be shown to be as hard as factoring n, meaning that if an adversary could recover the entire message from the encryption of the message they would be able to factor n. The semantic security (meaning adversaries cannot recover any information about the message from the encryption) rests on the p-subgroup assumption, which assumes that it is difficult to determine whether an element x in is in the subgroup of order p. This is very similar to the quadratic residuosity problem and the higher residuosity problem.
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.