IJPAM: Volume 87, No. 2 (2013)


S. Srinivasan$^1$, P. Muralikrishna$^2$, N. Chandramowliswaran$^3$
$^{1,2}$School of Advanced Sciences
VIT University
Vellore, 632014, Tamilnadu. INDIA
$^3$Visiting Faculty
Indian Institute of Management Indore
Indore, 453 331, INDIA

Abstract. In resent years the security of operations taking place over a computer network become very important. It is necessary to protect such actions against bad users who may try to misuse the system (e.g. steal credit card numbers, read personal mail, or impersonate other users.) Many protocols and schemes were designed to solve problem of this type. Threshold cryptography is a novel cryptographic technique sharing secret among members. It divides a secret key into multiple shares by a cryptographic operation. In this paper, we proposed a key distribution algorithm based on Simple Continued Fraction. The goal of our algorithm is to divide a secret $S$ into $\ell$ pieces $s_1+s_2+\dots+s_{\ell}$ such that, $\ell$ pieces are necessary to reconstruct $S,$ but any $m < \ell$ pieces give no information about $S.$

Received: June 15, 2013

AMS Subject Classification: 94A60, 94A62

Key Words and Phrases: simple continued fraction, shares, RSA prime

Download paper from here.

DOI: 10.12732/ijpam.v87i2.15 How to cite this paper?
International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2013
Volume: 87
Issue: 2