TR05-05 (2005) – Threshold RSA Based on the General Chinese Remainder Theorem

Sorin Iftene

In threshold (or group-oriented) cryptography the capacity of performing cryptographic operations such as decryption or digital signature generation is shared among members of a certain group. This can be achieved by combiningmultiplicative secret sharing schemes with homomorphic cryptographic operations. In this paper we focus on threshold RSA decryption and thresholdRSA digital signature generation.More exactly, we combine the threshold secret sharing schemes based on the Chinese remainder theoremwith the RSA cryptosystem, as an alternative to the classicalsolutions based on the Shamir’s threshold secret sharing scheme.

Bibtex

@TechReport{RSACRT,
author = "Sorin Iftene",
title = " Threshold {em RSA} Based on the General Chinese Remainder Theorem",
institution = "``Al.I.Cuza'' University of Ia{c s}i, 
                 Faculty of Computer Science",
year = "2005",
number = "TR 05-05",
note = "URL:http://www.infoiasi.ro/~tr/tr.pl.cgi"
}