DEFINITION OF MATHEMATICAL PROBLEM FOR CRYPTOGRAPHY USING DIRECT PRODUCT GROUP

Abstract

Cryptography depends on a continuing stream of new insights and methods from number theory, arithmetic algebraic geometry, and other branches of algebra. In this paper we proposes new concept in the public key cryptosystems that is depend on Direct Product Abelian Group. Two abelian groups can use direct product to construct an abelian group under addition and/or multiplication operations. There are a hard mathematical problem is proposed in the constructed group we call it Discrete Logarithm Problem of Direct Product Group. After that we design public key cryptosystems based on the suggested problem. Also it appears to offer equal security for a far smaller bit size, with problem harder than DLP.