Paper 2018/1133

A Public Key Exchange Cryptosystem Based on Ideal Secrecy

Vamshi Krishna Kammadanam, Virendra R. Sule, and Yi Hong

Abstract

This paper proposes two closely related asymmetric key (or a public key) schemes for key exchange whose security is based on the notion of ideal secrecy. In the first scheme, the private key consists of two singular matrices, a polar code matrix and a random permutation matrix all over the binary field. The sender transmits addition of two messages over a public channel using the public key of the receiver. The receiver can decrypt individual messages using the private key. An adversary, without the knowledge of the private key, can only compute multiple equiprobable solutions in a space of sufficiently large size related to the dimension of the kernel of the singular matrices. This achieves security in the sense of ideal secrecy. The next scheme extends over general matrices. The two schemes are cryptanalyzed against various attacks.

Note: Submitted on 21th Nov, 2018. Number of pages 21

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
one way functionideal secrecyasymmetric key cryptography
Contact author(s)
vrs @ ee iitb ac in
History
2018-11-29: received
Short URL
https://ia.cr/2018/1133
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2018/1133,
      author = {Vamshi Krishna Kammadanam and Virendra R.  Sule and Yi Hong},
      title = {A Public Key Exchange Cryptosystem Based on Ideal Secrecy},
      howpublished = {Cryptology {ePrint} Archive, Paper 2018/1133},
      year = {2018},
      url = {https://eprint.iacr.org/2018/1133}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.