A block based secret sharing scheme using Hilbert matrix and RSA
S. Thalapathiraj, P. Mohamed Fathimal, Bala Baskaran · AIP conference proceedings · 2019
Due to the impact of network technology, all information are transmitted in digital mode and the security of information is ever more important. In order to ensure the secret messages are not been stolen when transmitting, it will be a good countermeasure to encrypt the secret message before transmitting. The level of security of information is based on the number of participants. Security is definite when a single person is involved. In the scenario, if many people are involved, security may be ensured if secrets are kept in. This lead the direction for researchers to develop new cryptographic scheme in the past two decades. This paper proposes techniques for transmission of secret messages between two parties and also sharing of messages between multiple parties. These methods uses well known public key cryptography algorithm RSA and Hilbert matrix for authentication and encryption. The proposed method overcome the issues addressed by the existing scheme and ensures secure transmission of text messages with less computational Complexity and no additional code book. The proposed (N, N) Secret sharing Scheme also reduces the overhead of generation of keys for each pair of parties.