Public-Key Encryption Based on Matrix Diagonalization Problem

Jiande Zheng

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Public-Key Encryption Based on Matrix Diagonalization Problem

In Proceedings of the 3rd International Workshop on Security in Information Systems - Volume 0ICEIS, 102-112, 2005 , Miami, United States

Author: Jiande Zheng

Affiliation: Xiamen University, China

Abstract: A research on the development of a new public-key encryption scheme based on matrix diagonalization problem over a ring of algebraic integers is reported in this paper. The research is original, although it is still in its early stage. The new public key encryption algorithm has three original features that distinguish it from existing ones: (a) it works on an infinite field instead of a Galois field; (b)it recognizes the ability of adversaries to factor big integers; (c) it requires only simple (without modulus) additions and multiplications for message encryption and decryption, no high-order exponentiation is required.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.21.231.245

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Zheng, J. (2005). Public-Key Encryption Based on Matrix Diagonalization Problem. In Proceedings of the 3rd International Workshop on Security in Information Systems (ICEIS 2005) - WOSIS; ISBN 972-8865-25-2, SciTePress, pages 102-112. DOI: 10.5220/0002543101020112

@conference{wosis05,
author={Jiande Zheng.},
title={Public-Key Encryption Based on Matrix Diagonalization Problem},
booktitle={Proceedings of the 3rd International Workshop on Security in Information Systems (ICEIS 2005) - WOSIS},
year={2005},
pages={102-112},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002543101020112},
isbn={972-8865-25-2},
}

TY - CONF

JO - Proceedings of the 3rd International Workshop on Security in Information Systems (ICEIS 2005) - WOSIS
TI - Public-Key Encryption Based on Matrix Diagonalization Problem
SN - 972-8865-25-2
AU - Zheng, J.
PY - 2005
SP - 102
EP - 112
DO - 10.5220/0002543101020112
PB - SciTePress