loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Neculai Daniel Stoleru and Victor Valeriu Patriciu

Affiliation: Military Technical Academy, Romania

ISBN: 978-989-8111-12-8

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..

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

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

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.; Valeriu Patriciu V. and (2007). THE POLYNOMIAL MULTICOMPOSITION PROBLEM IN (Z/nZ).In Proceedings of the Second International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2007) ISBN 978-989-8111-12-8, 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 - Volume 1: SECRYPT, (ICETE 2007)},
year={2007},
pages={269-272},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002123402690272},
isbn={978-989-8111-12-8},
}

TY - CONF

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

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.