THE POLYNOMIAL MULTICOMPOSITION PROBLEM IN (Z/nZ)

Neculai Daniel Stoleru; Victor Valeriu Patriciu

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

THE POLYNOMIAL MULTICOMPOSITION PROBLEM IN (Z/nZ)

Topics: Public Key Crypto Applications

In Proceedings of the Second International Conference on Security and Cryptography - Volume 0ICETE, 269-272, 2007 , Barcelona, Spain

Authors: Neculai Daniel Stoleru and Victor Valeriu Patriciu

Affiliation: Military Technical Academy, Romania

Keyword(s): Polynomial composition, identification, key agreement.

Related Ontology Subjects/Areas/Topics: Cryptographic Techniques and Key Management ; Information and Systems Security ; Public Key Crypto Applications

Abstract: Generally, the public-key cryptographic schemes base their security on the difficulty of solving hard mathematical problems. The number of such problems currently known is relative reduced. Therefore the further investigation of mathematical problems with applications in cryptography is of central interest. This paper explores a new problem based on polynomial composition. We analyze the connections between the proposed problem and the RSA problem. Adjacent, we derive from it a zero – knowledge identification protocol. We show that the method allows the definition of a commutative class of polynomials. Based on this class, a “Diffie – Hellman like” key exchange protocol can be devised..

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 18.118.144.69

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:

Daniel Stoleru, N. and Valeriu Patriciu, V. (2007). THE POLYNOMIAL MULTICOMPOSITION PROBLEM IN (Z/nZ). In Proceedings of the Second International Conference on Security and Cryptography (ICETE 2007) - SECRYPT; ISBN 978-989-8111-12-8; ISSN 2184-3236, SciTePress, pages 269-272. DOI: 10.5220/0002123402690272

@conference{secrypt07,
author={Neculai {Daniel Stoleru}. and Victor {Valeriu Patriciu}.},
title={THE POLYNOMIAL MULTICOMPOSITION PROBLEM IN (Z/nZ)},
booktitle={Proceedings of the Second International Conference on Security and Cryptography (ICETE 2007) - SECRYPT},
year={2007},
pages={269-272},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002123402690272},
isbn={978-989-8111-12-8},
issn={2184-3236},
}

TY - CONF

JO - Proceedings of the Second International Conference on Security and Cryptography (ICETE 2007) - SECRYPT
TI - THE POLYNOMIAL MULTICOMPOSITION PROBLEM IN (Z/nZ)
SN - 978-989-8111-12-8
IS - 2184-3236
AU - Daniel Stoleru, N.
AU - Valeriu Patriciu, V.
PY - 2007
SP - 269
EP - 272
DO - 10.5220/0002123402690272
PB - SciTePress