A Novel Public Key Cryptosystem Based on Ergodic Matrix over GF(2)

Author

Zheng-jun, Jing ; Guo-ping, Jiang ; Chun-sheng, Gu

Author_Institution

Coll. of Comput., Nanjing Univ. of Posts & Telecommun., Nanjing, China

fYear

2012

fDate

11-13 Aug. 2012

Firstpage

845

Lastpage

848

Abstract

This paper constructs a new EL Gamal-type public key cryptosystem based on the irreducibility of characteristic polynomial of ergodic matrices over, whose security is equivalent to the difficulty of polynomial discrete logarithm problem over binary finite field. Since plaintext is represented by matrix and its message expansion is almost 1, the novel scheme can encrypt effectively more information one time.

Keywords

matrix algebra; polynomials; public key cryptography; ELGamal-type public key cryptosystem; GF(2); binary finite field; characteristic polynomial irreducibility; encryption; ergodic matrix; message expansion; plaintext representation; polynomial discrete logarithm problem; Educational institutions; Encryption; Galois fields; Polynomials; Public key cryptography; discrete logarithm; ergodic matrix; public key encryption;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science & Service System (CSSS), 2012 International Conference on

Conference_Location

Nanjing

Print_ISBN

978-1-4673-0721-5

Type

conf

DOI

10.1109/CSSS.2012.216

Filename

6394454

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2718226