No Detail Found!

π-McCoy rings as a basis of a zero knowledge cryptosystem

Author(s)
Areej M. Abduldaim University of Technology, Applied Sciences Department, Mathematics and Computer Applications, Baghdad, Iraq
Abstract
In this paper, a novel approach for conveying abstract algebra, that represented by ring theory and algebraic structures, to cryptography is proposed. The zero-knowledge proof is an interactive cryptosystem used for identification. Ring theory, through the algebraic structure π-McCoy rings, is taken into consideration to construct a new algorithm for the zeroknowledge proof used a secret polynomial and specific parameters that achieve some conditions based on satisfying if the notion of -McCoy rings and some characterizations. The aim is to introduce a modern algorithm with a key polynomial whose coefficients are in a πMcCoy ring and this polynomial is protected by the prover. In fact, the πMcCoy zero-knowledge scheme does not detect the original secret polynomial. This scheme is particularly useful in cryptographic applications, such as digital signature and key agreement.
Publication Details
Page(s) 7-11
DOI DOI not available
Published Journal: Science International, Volume: 32, Issue: 1, Year: 2020

Request the full text from PASTIC

Keywords
Identification, polynomial rings, -McCoy rings, nilpotent polynomial, zero-knowledge proof
0

Citations

0

Downloads

235

Views