Using NP Problems to Share Keys in Secret-Key Cryptography

Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2015, Vol 17, Issue 6

Abstract

Abstract: Public key cryptography has now become an important means for providing confidentiality by its use of key distribution, in which users can do private communication with the help of encryption keys. It also provides digital signatures which allow users to sign keys to verify their identities. But public key cryptography has its own shortcoming regarding to high cost in keys distribution and excessive computation in encoding and decoding it. Whereas private key can omit all above problems but only if we can find a way to share private key confidentially. This research presents an innovation, which can be our future approach, using technology so-called NP problems, of sending or sharing keys to the receiver without any need of the third party. This will provide an open idea where sender and receiver can share any key for any number of times for encrypting data confidentially that also helpful in overcoming problem of brute force attack.

Authors and Affiliations

Yashasvini Sharma

Keywords

Related Articles

 Improvement of limited Storage Placement in Wireless Sensor  Network

 In sensor network a large amount of data need to be collected for future information retrieval. The data centric storage has become an important issue in sensor network. Storage nodes are used in this paper to &...

 Methods of Gathering Data for Research Purpose and  Applications Using IJSER Acceptance Rate of Monthly Paper  Publication (March 2012 Edition-May 2013 Edition)

 A good number of scientist or researchers find it very difficult in carrying out their research work successfully due to lack of good knowledge of data collection method and application. Data is referred to as a...

 Design and Simulation of Dct Chip In Vhdl and Application in Watermark Extraction

 Abstract: The paper presented the design, modeling and chip implementation of 2D Discrete Cosine Transform (DCT) domain for copyright protection of images, as digital watermarking chip. Recent improvement in comput...

 Survey on Reversible Watermarking

 A number of research papers has been produced about reversible watermarking. Reversible watermarking is one of the important scheme of the watermarking schemes. Some security measures must be  there to prot...

 Latent Fingerprint Matching Using Grey Level Co-Occurrence Matrix

 Abstract: Recognizing defendant based on impressions of fingers from crime scenes is important to law enforcement agencies. Latents are partial fingerprints with small area, contain nonlinear distortion,and are usu...

Download PDF file
  • EP ID EP133092
  • DOI -
  • Views 136
  • Downloads 0

How To Cite

Yashasvini Sharma (2015). Using NP Problems to Share Keys in Secret-Key Cryptography. IOSR Journals (IOSR Journal of Computer Engineering), 17(6), 50-52. https://europub.co.uk/articles/-A-133092