Construct public key encryption scheme using ergodic matrices over GF(2)

Authors:
Pei Shi-Hui;Zhao Yong-Zhe;Zhao Hong-Wei
Affiliations:
College of Computer Science and Technology, Jilin University, Changchun, Jilin, PRC;College of Computer Science and Technology, Jilin University, Changchun, Jilin, PRC;College of Computer Science and Technology, Jilin University, Changchun, Jilin, PRC
Venue:
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Year:
2007

Citing 4
Cited 0

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C

Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Handbook of Applied Cryptography

Handbook of Applied Cryptography
A New Construction of Massey-Omura Parallel Multiplier over GF(2^{m})

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new public key encryption scheme. It is based on the difficulty of deducing x and y from A and B = x ċ A ċ y in a specific monoid (m, ċ) which is noncommutative. So we select and do research work on the certain monoid which is formed by all the n×n matrices over finite field F2 under multiplication. By the cryptographic properties of an "ergodic matrix", we propose a hard problem based on the ergodic matrices over F2, and use it construct a public key encryption scheme.