Conjugacy systems based on nonabelian factorization problems and their applications in cryptography

DOI10.1155/2014/630607zbMath1442.94037OpenAlexW2081907889WikidataQ59053865 ScholiaQ59053865MaRDI QIDQ2336603

Lize Gu, Shi-Hui Zheng

Publication date: 19 November 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/630607

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Privacy preservation for machine learning training and classification based on homomorphic encryption schemes ⋮ Two general schemes of algebraic cryptography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to construct efficient signcryption schemes on elliptic curves
• An algebraic method for public-key cryptography
• New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
• Cryptosystems using linear groups
• A weak key test for braid based cryptography.
• Secure communications over insecure channels
• Non-commutative digital signatures
• New Constructions of Public-Key Encryption Schemes from Conjugacy Search Problems
• A Simple Generalization of the ElGamal Cryptosystem to Non-Abelian Groups
• Thompson’s Group and Public Key Cryptography
• Practical Signcryption
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Elliptic Curve Cryptosystems
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Conjugate adjoining problem in braid groups and new design of braid-based signatures
• Cryptography and Coding

This page was built for publication: Conjugacy systems based on nonabelian factorization problems and their applications in cryptography