Open Access
Translator Disclaimer
2014 Conjugacy Systems Based on Nonabelian Factorization Problems and Their Applications in Cryptography
Lize Gu, Shihui Zheng
J. Appl. Math. 2014: 1-10 (2014). DOI: 10.1155/2014/630607

Abstract

To resist known quantum algorithm attacks, several nonabelian algebraic structures mounted upon the stage of modern cryptography. Recently, Baba et al. proposed an important analogy from the integer factorization problem to the factorization problem over nonabelian groups. In this paper, we propose several conjugated problems related to the factorization problem over nonabelian groups and then present three constructions of cryptographic primitives based on these newly introduced conjugacy systems: encryption, signature, and signcryption. Sample implementations of our proposal as well as the related performance analysis are also presented.

Citation

Download Citation

Lize Gu. Shihui Zheng. "Conjugacy Systems Based on Nonabelian Factorization Problems and Their Applications in Cryptography." J. Appl. Math. 2014 1 - 10, 2014. https://doi.org/10.1155/2014/630607

Information

Published: 2014
First available in Project Euclid: 2 March 2015

zbMATH: 07131752
MathSciNet: MR3206887
Digital Object Identifier: 10.1155/2014/630607

Rights: Copyright © 2014 Hindawi

JOURNAL ARTICLE
10 PAGES


SHARE
Vol.2014 • 2014
Back to Top