Simple Dynamic Threshold Decryption Based on CRT and RSA

Authors

  • Bartosz Nakielski
  • Jacek Pomykała

DOI:

https://doi.org/10.26636/jtit.2009.2.930

Keywords:

CRT, RSA, threshold decryption

Abstract

In the paper we present a simple threshold decryption system based on the RSA cryptosystem. Our model avoids the application of the Shamir secret sharing protocol and is based only on the Chinese reminder theorem. The flexibility in the threshold level is attained due to the suitable preparation of the input data. The second part of the article describes a modification of the basic model, which admits the sender’s impact on the choice of the real receiver’s group.

Downloads

Download data is not yet available.

Downloads

Published

2009-06-30

Issue

Section

ARTICLES FROM THIS ISSUE

How to Cite

[1]
B. Nakielski and J. Pomykała, “Simple Dynamic Threshold Decryption Based on CRT and RSA”, JTIT, vol. 36, no. 2, pp. 70–73, Jun. 2009, doi: 10.26636/jtit.2009.2.930.