Provable security for communication on the internet

Authors:
T. J. Mathew
Affiliations:
Jankidevi Bajaj Institute of Management Studies, S.N.D.T. Women's University, Mumbai, India
Venue:
ICCC '02 Proceedings of the 15th international conference on Computer communication
Year:
2002

Citing 5
Cited 0

A public key cryptosystem based on the word problem

Proceedings of CRYPTO 84 on Advances in cryptology
Encyclopedia of computer science (3rd ed.)

Encyclopedia of computer science (3rd ed.)
Cryptanalysis and protocol failures

Communications of the ACM
Primality and Cryptography

Primality and Cryptography
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

Abstract

The quest of modern cryptography is to prove the security of cryptographic systems mathematically. The most well known procedure for this is to base the design of cryptographic algorithms on problems that have a high level of computational complexity. In this paper we describe a single-key encryption scheme and offers a proof of the computational complexity of this scheme based on the NP-complete Clause Satisfiability Problem (CSP).