See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/271530240

On the Group Based Cryptography

Article · November 2014

CITATIONS READS

0 253

1 author:

Mehmet Kalkan
Nevşehir Hacı Bektaş Veli University
2 PUBLICATIONS   0 CITATIONS   

SEE PROFILE

All content following this page was uploaded by Mehmet Kalkan on 22 October 2018.

The user has requested enhancement of the downloaded file.

Journal of Mathematics and System Science 4 (2014) 710-714 D DAVID PUBLISHING

On the Group Based Cryptography

Mehmet KALKAN1, Hacı AKTAŞ2

1. Nevşehir Hacı Bektaş Veli University, Faculty of Science, Department of Mathematics, Turkey
2. Erciyes University, Faculty of Science, Department of Mathematic, Turkey

Received: July 23, 2014 / Accepted: August 22, 2014 / Published: November 25, 2014.

Abstract: There are quite more applications of group theory. The recent application of group theory is public key (asymmetric)
cryptography. All cryptographic algorithms have some weaknesses. To avoid its weakness, some special groups and methods can
applied on. We will touch on group based public key cryptography and will give some suggestions in this area.

Keywords: Soft Groups, Soft Cryptography, Public Key Cryptography.

1. Introduction KEP: Key exchange problem

DLP: Discrete logarithm problem
The modern cryptography mainly can be divided
IP: The isomorphism problem
into two areas of study.
To overcome these cryptographic algorithm's
The first one is symmetric-key cryptography which
problems, many researchers deal with the group based
refers to encryption methods in which both the sender
cryptography in the last ten years. Both commutative
and receiver use the same key. DES, AES, RC4, MD,
and non-commutative group can be used as platform
SHA, and FEAL are the most used ones. The
for public-key cryptographic systems especially RSA,
triple-DES used for ATM machines and e-mails. And
the Diffie-Hellman and the El-Gamal protocols.
even were discussed if DES is a group [1]. But later,
Blackburn, Cid and Mullan in [4] says
Campbell and Wiener proved that DES is not a group
"Group-based cryptosystems have not yet led to
[2].
practical schemes to rival RSA and Diffie-Hellman,
Secondly, Public-key cryptosystems use the public
but the ideas are interesting and the different
key for encryption and secret key for decryption of a
perspective leads to some worthwhile group theory."
message. RSA is used for secure data transmission as
The most useful group platforms are [5];
a public-key cryptosystem. The entire cryptographic
Thompson's group F, Matrix groups, Small
algorithm has some problems and weaknesses. The
cancellation groups, Braid groups, Artin groups,
most important ones are:
Permutation group mappings (PGM), Grigorchuck's
DHP: Diffie-Helman problem
group, Finite group mappings (FGM), Polycyclic
MSP: The membership search problem
groups, Cyclic groups, Solvable groups, etc.
CSP: Conjugacy search problem
FSP: The factorization search problem 2. Experimental Section
WP: The word problem The basic group based cryptographic systems and
DSP: The decomposition search problem protocols are given in this system. In these parts Alice
GFP: Generalized factor problem and Bob are computers.

Corresponding author: Mehmet KALKAN, Nevşehir Hacı 2.1 RSA

Bektaş Veli University, Faculty of Science, Department of
Mathematics, Turkey. E-mail: [email protected]. RSA is the most famous public key encryption
 On the Group Based Cryptography 711

protocol is related to the integer factorization problem group.

based on Euler's theorem [6-8]. RSA uses a public key For given a non-commutative 𝐺𝐺 and an element
and a private key. In the following way one can 𝑔𝑔 ∈ 𝐺𝐺 known by everyone and 𝐴𝐴, 𝐵𝐵 ≤ 𝐺𝐺 be
generate the keys : commuting subgroups. A common secret key created
(1) Alice chooses two distinct primes 𝑝𝑝, 𝑞𝑞 and by Alice and Bob proceed as follows:
compute; 𝑛𝑛 = 𝑝𝑝𝑝𝑝 and selects an integer (1) Alice selects an element 𝑎𝑎 ∈ 𝐴𝐴, computes
1 < 𝑒𝑒 < 𝜙𝜙(𝑛𝑛) , 𝑔𝑔𝑎𝑎 = 𝑎𝑎⁻¹𝑔𝑔𝑔𝑔,
The integers 𝑝𝑝 and 𝑞𝑞 should be chosen at random, and sends it to Bob.
and should be of similar bit-length (2) Bob selects an element 𝑏𝑏 ∈ 𝐵𝐵, computes
𝜙𝜙(𝑛𝑛) = 𝜙𝜙(𝑝𝑝)𝜙𝜙(𝑞𝑞 ) = (𝑝𝑝 − 1)(𝑞𝑞 − 1) 𝑔𝑔𝑏𝑏 = 𝑏𝑏−1 𝑔𝑔𝑔𝑔,
= 𝑛𝑛 − (𝑝𝑝 + 𝑞𝑞 − 1), and sends it to Alice.
Where 𝜙𝜙 is Euler's totient function and with (3) Alice computes 𝐾𝐾𝑎𝑎 = (𝑔𝑔𝑏𝑏 )𝑎𝑎 , while Bob
𝑔𝑔𝑔𝑔𝑔𝑔(𝑒𝑒, 𝜙𝜙(𝑛𝑛)) = 1 computes 𝐾𝐾𝑏𝑏 = (𝑔𝑔𝑎𝑎 )𝑏𝑏 . Since 𝑎𝑎𝑎𝑎 = 𝑏𝑏𝑏𝑏 , we have
She publishes 𝑛𝑛, 𝑒𝑒 where her secret key is an 𝐾𝐾 = 𝐾𝐾𝑎𝑎 = 𝐾𝐾𝑏𝑏 , as common secret key.
integer 𝑑𝑑 such that Ko et al. [10] choose the platform group 𝐺𝐺 as the
𝐷𝐷 = 𝑒𝑒 − 1 (𝑚𝑚𝑚𝑚𝑚𝑚 𝜙𝜙(𝑛𝑛)). Braid group 𝐵𝐵𝑛𝑛 and the subgroups 𝐴𝐴, 𝐵𝐵 as follows
(2) Bob encodes his message using integers [11];
0 ≤ 𝑚𝑚 ≤ 𝑛𝑛 − 1 𝜎𝜎1 , 𝜎𝜎 2 , … … , 𝜎𝜎 𝑛𝑛−1 , ∣ 𝜎𝜎𝑖𝑖 𝜎𝜎𝑗𝑗 = 𝜎𝜎𝑗𝑗 𝜎𝜎𝑖𝑖
𝐵𝐵𝐵𝐵 = 〈 ,〉
For every integer 𝑚𝑚 , Bob sends 𝑚𝑚 e 𝑚𝑚𝑚𝑚𝑚𝑚 𝑛𝑛 to 𝜎𝜎𝑖𝑖 𝜎𝜎𝑗𝑗 𝜎𝜎𝑖𝑖 = 𝜎𝜎𝑗𝑗 𝜎𝜎𝑖𝑖 𝜎𝜎𝑗𝑗 for |𝑖𝑖 − 𝑗𝑗| = 1
Alice. for given integers 𝑠𝑠, 𝑡𝑡 such that 𝑠𝑠 + 𝑡𝑡 = 𝑛𝑛, then
(3) Alice computes 𝐴𝐴 = 〈𝜎𝜎₁, 𝜎𝜎₂, . . . . . . , 𝜎𝜎𝑠𝑠−1 〉
𝑚𝑚 = 𝑚𝑚ed = (𝑚𝑚e)d (𝑚𝑚𝑚𝑚𝑚𝑚 𝑛𝑛). 𝐵𝐵 = 〈𝜎𝜎𝑠𝑠+1 , 𝜎𝜎𝑠𝑠+2 , . . . . . . , 𝜎𝜎𝑠𝑠+𝑡𝑡−1 〉
Because of the existence of a good normal form for
2.2 Diffie-Hellman Key Exchange Protocol
the elements of Braid groups like group multiplication
Discrete logarithm protocol, presented by Diffie and inversion, they choose Braid for platform. But
and Hellman [4,6,9], uses a finite cyclic group 𝐺𝐺 still the choosing of the elements 𝑎𝑎 and 𝑏𝑏 are not
with generator 𝑔𝑔 where 𝑔𝑔 and the order 𝑑𝑑 are obvious since 𝐴𝐴, 𝐵𝐵 are not finite.
known;
2.4 Anshelet all Key Agreement Protocol
Let 𝑎𝑎, 𝑏𝑏 ∈ [2, 𝑑𝑑 − 1]
(1) Alice arbitrarily chooses an integer 𝑎𝑎 and then Let 𝐺𝐺 be non-commutative group and let
sends 𝑔𝑔𝑎𝑎 to Bob, 𝑎𝑎1 , . . . , 𝑎𝑎𝑘𝑘 , 𝑏𝑏1 , . . . . , 𝑏𝑏𝑚𝑚 ∈ 𝐺𝐺 is known by public [4]:
(2) Bob chooses 𝑏𝑏 in the same way and sends 𝑔𝑔𝑏𝑏 (1) Alice computes a private word
to Alice, 𝑥𝑥 = 𝑥𝑥(𝑎𝑎₁, . . . , 𝑎𝑎𝑘𝑘 ) on 𝑎𝑎₁, . . . . . . 𝑎𝑎 k and sends
(3) Alice calculates 𝑔𝑔𝑏𝑏𝑏𝑏 = (𝑔𝑔𝑏𝑏 )𝑎𝑎 where Bob gets 𝑏𝑏1𝑥𝑥 , . . . , 𝑏𝑏𝑚𝑚
𝑥𝑥
to Bob.
𝑔𝑔𝑎𝑎𝑎𝑎 = (𝑔𝑔𝑎𝑎 )𝑏𝑏 (2) Bob picks a private word 𝑦𝑦 in
(4) The common key is 𝑦𝑦 = 𝑦𝑦(𝑏𝑏₁, . . . , 𝑏𝑏𝑘𝑘 ) on 𝑏𝑏₁, . . . , 𝑏𝑏𝑚𝑚 and sends
𝑦𝑦 𝑦𝑦
𝐾𝐾 = 𝑔𝑔𝑏𝑏𝑏𝑏 = 𝑔𝑔𝑎𝑎𝑎𝑎 ∈ 𝐺𝐺. 𝑎𝑎1 , . . . , 𝑎𝑎𝑚𝑚 to Alice.
(3) Alice computes 𝑥𝑥 𝑦𝑦 and Bob computes 𝑦𝑦 𝑥𝑥 .
2.3 Ko et al. Key Agreement Protocol
(4) So secret key 𝐾𝐾is [𝑥𝑥, 𝑦𝑦] = 𝑥𝑥⁻¹𝑦𝑦⁻¹𝑥𝑥𝑥𝑥.
Ko et al. Key Agreement Protocol [4,6,10] the most As like Ko et all, they also used Braid group as the
critical point of this protocol is the chosen platform platform group, too.
712 On the Group Based Cryptography

2.5 The Stickel Key Agreement Protocol Private Key: 𝑡𝑡, 𝑠𝑠 ∈ ℕ . Public Key: 𝐴𝐴 and 𝐴𝐴𝑡𝑡 ,
where 𝐴𝐴 ∈ 𝑆𝑆𝑆𝑆(𝑑𝑑, 𝑞𝑞).
Let 𝐺𝐺 = 𝐺𝐺𝐺𝐺(𝑛𝑛, 𝐹𝐹𝑞𝑞 ), and let 𝑔𝑔 ∈ 𝐺𝐺. Let 𝑎𝑎, 𝑏𝑏 ∈ 𝐺𝐺 of
Encryption.
order 𝑛𝑛𝑎𝑎 and 𝑛𝑛𝑏𝑏 respectively, and suppose that
(1) To send a plaintext 𝑣𝑣 ∈ 𝔽𝔽𝑑𝑑𝑞𝑞 , Bob computes 𝐴𝐴𝑠𝑠
𝑎𝑎𝑎𝑎 ≠ 𝑏𝑏𝑏𝑏. The group 𝐺𝐺 and 𝑎𝑎, 𝑏𝑏 are publicly known.
and 𝐴𝐴𝑡𝑡𝑡𝑡 for an arbitrary 𝑟𝑟 ∈ ℕ.
The procedure is as follows [4]:
(2) The cipher text is (𝐴𝐴𝑠𝑠 , 𝐴𝐴𝑡𝑡𝑡𝑡 𝑣𝑣 𝑇𝑇 ) where 𝑣𝑣 𝑇𝑇 is the
(1) Alice takes integers l, 𝑚𝑚 uniformly and
transpose of 𝑣𝑣.
randomly, where 0 < 𝑙𝑙 < 𝑛𝑛𝑎𝑎 and 0 < 𝑚𝑚 < 𝑛𝑛𝑏𝑏 . She
Decryption.
sends 𝑢𝑢 = 𝑎𝑎𝑙𝑙 𝑔𝑔𝑏𝑏𝑚𝑚 to Bob. 1. Alice knows 𝑚𝑚, when she receives the cipher
(2) Bob takes integers 𝑟𝑟, 𝑠𝑠 uniformly at random,
text (𝐴𝐴𝑠𝑠 , 𝐴𝐴𝑡𝑡𝑡𝑡 𝑣𝑣 𝑇𝑇 ) she computes 𝐴𝐴𝑡𝑡𝑡𝑡 from 𝐴𝐴𝑠𝑠 , then
where 0 < 𝑟𝑟 < 𝑛𝑛𝑎𝑎 and 0 < 𝑠𝑠 < 𝑛𝑛𝑏𝑏 . He sends 𝐴𝐴−𝑡𝑡𝑡𝑡 and then computes v from 𝐴𝐴𝑡𝑡𝑡𝑡 𝑣𝑣 𝑇𝑇 .
𝑣𝑣 = 𝑎𝑎𝑟𝑟 𝑔𝑔𝑏𝑏 𝑠𝑠 to Alice. He shows that the security of the El-Gamal
(3) Alice computes cryptosystem over 𝑆𝑆𝑆𝑆(𝑑𝑑, 𝑞𝑞) , is equivalent to the
𝑘𝑘𝑎𝑎 = 𝑎𝑎𝑙𝑙 𝑣𝑣𝑏𝑏𝑚𝑚 = 𝑎𝑎𝑙𝑙+𝑟𝑟 𝑔𝑔𝑏𝑏𝑚𝑚+𝑠𝑠 . Diffie-Hellman problem in 𝑆𝑆𝑆𝑆(𝑑𝑑, 𝑞𝑞).
Bob computes
𝑘𝑘𝑏𝑏 = 𝑎𝑎𝑟𝑟 𝑢𝑢𝑏𝑏 𝑠𝑠 = 𝑎𝑎𝑙𝑙+𝑟𝑟 𝑔𝑔𝑏𝑏𝑚𝑚 +𝑠𝑠 . 3. Some Problems
So they shared key as 3.1 DLP
𝐾𝐾 = 𝑘𝑘𝑎𝑎 = 𝑘𝑘𝑏𝑏 .
Here Discrete Logarithm Problem (DLP) can be
2.6 Diffie-Hellman KEP Using Matrices Over 𝑍𝑍𝑛𝑛 [𝑆𝑆𝑚𝑚 ] given as [4]; The cyclic group G with generator g is
given then for given ℎ ∈ 𝐺𝐺, find an element 𝑥𝑥 such
Kahrobaei et all, proposed to work with the group
that 𝑔𝑔 𝑥𝑥 = ℎ.
ring 𝑍𝑍₇[𝑆𝑆₅], which has the size 75! = 7¹²⁰ and the
semi group 𝑀𝑀₃(𝑍𝑍₇[𝑆𝑆₅]) of 3 × 3 matrices has the 3.2 The Conjugacy Search Problem
5!
order (7 )⁹ ≈ 10⁹¹³. They used this semi group of
Let 𝐺𝐺 be a non-abelian group. Let 𝑔𝑔, ℎ ∈ 𝐺𝐺 be
matrices as the platform of the key exchange protocol;
such that ℎ = 𝑔𝑔 𝑥𝑥 for some 𝑥𝑥 ∈ 𝐺𝐺 where the
(1) Alice chooses a public matrix 𝑀𝑀 ∈ 𝑀𝑀₃(𝑍𝑍₇[𝑆𝑆₅])
conjugate of g by 𝑥𝑥 is 𝑥𝑥⁻¹𝑔𝑔𝑔𝑔. Given the elements 𝑔𝑔
and a private large positive integer 𝑎𝑎, computes 𝑀𝑀𝑎𝑎 ,
and ℎ, find an element 𝑦𝑦 ∈ 𝐺𝐺 such that h = 𝑔𝑔 𝑦𝑦 .
and publishes (𝑀𝑀, 𝑀𝑀𝑎𝑎 ).
(2) Bob chooses another large integer 𝑏𝑏 , and 3.3 The Word Problem [3,6]
computes and publishes (𝑀𝑀𝑏𝑏 𝑏𝑏). The word 𝑤𝑤 is given in terms of generator of the
(3) Both Alice and Bob can now compute the same group 𝐺𝐺; find if 𝑤𝑤 = 1 ∈ 𝐺𝐺 in finitely tried steps.
shared secret key
𝐾𝐾 = (𝑀𝑀𝑎𝑎 )𝑏𝑏 = (𝑀𝑀𝑏𝑏 )𝑎𝑎 3.4 The Isomorphism Problem [6]

2.7 The El-Gamal over 𝑆𝑆𝑆𝑆(𝑑𝑑, 𝑞𝑞) Let 𝐺𝐺 and 𝐺𝐺′ be two presentations. Find in
finitely many times that the group 𝐺𝐺 is isomorphic to
Mahalanobis [17], discusses the discrete logarithm 𝐺𝐺′ or not.
problem in circulant matrices.
3.5 Generalized Conjugacy Search Problem[14]
Definition 2.1 A 𝑑𝑑 × 𝑑𝑑 matrix over a field 𝐹𝐹 is
called a circulant matrix, if every row except the first Given 𝑥𝑥, 𝑦𝑦 ∈ 𝐵𝐵𝑛𝑛 such that 𝑦𝑦 = 𝑎𝑎⁻¹𝑥𝑥𝑥𝑥 for some
row, is a right circular shift of the row above that. So a 𝑎𝑎 ∈ 𝐿𝐿𝐵𝐵𝑛𝑛 .
circulant matrix is defined by its first row. Find 𝑏𝑏 ∈ 𝐿𝐿𝐵𝐵𝑛𝑛 such that 𝑦𝑦 = 𝑏𝑏⁻¹𝑥𝑥𝑥𝑥.
 On the Group Based Cryptography 713

3.6 Diffie-Hellman type Generalized Conjugacy (1) (𝐹𝐹, 𝐴𝐴) is said to be an identity soft group over
Search Problem[14] 𝐺𝐺 if 𝐹𝐹(𝑥𝑥) = {𝑒𝑒} for all 𝑥𝑥 ∈ 𝐴𝐴 , where 𝑒𝑒 is the
identity element of 𝐺𝐺.
Given 𝑥𝑥, 𝑦𝑦𝐴𝐴, 𝑦𝑦𝐵𝐵 ∈ B𝑛𝑛 such that 𝑦𝑦𝐴𝐴 = 𝑎𝑎⁻¹𝑥𝑥𝑥𝑥 and
(2) (𝐹𝐹, 𝐴𝐴) is said to be an absolute soft group over
𝑦𝑦𝐵𝐵 = 𝑏𝑏⁻¹𝑥𝑥𝑥𝑥 for some 𝑎𝑎 ∈ 𝐿𝐿𝐵𝐵𝑛𝑛 and 𝑏𝑏 ∈ 𝑈𝑈𝐵𝐵𝑛𝑛 .
𝐺𝐺 if 𝐹𝐹(𝑥𝑥) = 𝐺𝐺 for all 𝑥𝑥 ∈ 𝐴𝐴.
Find 𝑏𝑏⁻¹𝑦𝑦𝐴𝐴 𝑏𝑏 = 𝑎𝑎⁻¹𝑦𝑦𝐵𝐵 𝑎𝑎 = 𝑎𝑎⁻¹𝑏𝑏⁻¹𝑥𝑥𝑥𝑥𝑥𝑥.
Definition 4.5. Let (𝐹𝐹, 𝐴𝐴) and (𝐻𝐻, 𝐾𝐾) be two soft
3.7 Multiple Simultaneous Conjugacy Search groups over 𝐺𝐺. Then (𝐻𝐻, 𝐾𝐾) is a soft subgroup of
Problem[14] (𝐹𝐹, 𝐴𝐴), written as (𝐻𝐻, 𝐾𝐾) < (𝐹𝐹, 𝐴𝐴) ̃ , if
Given 𝑥𝑥𝑖𝑖 , 𝑦𝑦𝑖𝑖 ∈ 𝐵𝐵𝑁𝑁 , 1 ≤ 𝑖𝑖 ≤ 𝑡𝑡 such that 𝑦𝑦𝑖𝑖 = (1) 𝐾𝐾 ⊂ 𝐴𝐴,
𝑎𝑎⁻¹𝑥𝑥𝑖𝑖 𝑎𝑎 for some 𝑎𝑎 ∈ 𝐵𝐵𝑛𝑛 . (2) 𝐻𝐻(𝑥𝑥) is a subgroup of 𝐹𝐹(𝑥𝑥) for all 𝑥𝑥 ∈ 𝐾𝐾
Find 𝑏𝑏 ∈ 𝐵𝐵𝑛𝑛 such that 𝑦𝑦𝑖𝑖 = 𝑏𝑏⁻¹𝑥𝑥𝑖𝑖 𝑏𝑏 for all 𝑖𝑖. [19,24].
For more Braid group cryptography see [15]. Definition 4.6 Let (𝐹𝐹, 𝐴𝐴) be a soft group over 𝐺𝐺
and 𝑋𝑋 an element of 𝑃𝑃(𝐺𝐺). The set
4. Soft Cryptography {(𝑎𝑎, ⟨𝑥𝑥⟩) ∶ 𝐹𝐹(𝑎𝑎) = ⟨𝑥𝑥⟩, 𝑥𝑥 ∈ 𝑋𝑋}
The complicated problem in economics, is called a soft subset of (𝐹𝐹, 𝐴𝐴) generated by the set 𝑋𝑋
engineering, environment and computer cannot be and denoted by ⟨𝑋𝑋⟩. If (𝐹𝐹, 𝐴𝐴) = ⟨𝑋𝑋⟩, then the soft
successfully solved by using classical method because group (𝐹𝐹, 𝐴𝐴) is called the cyclic soft group generated
of various uncertainties [18]. But Molodtsov by 𝑋𝑋 [24].
successfully applied the soft theory into several area. If (𝐹𝐹, 𝐴𝐴) is a cyclic soft group over 𝐺𝐺, then we
Some basic notion of soft set theory [19] and soft have
groups [20, 21, 22, 24] are given. In most papers it has (𝐹𝐹, 𝐴𝐴) = {𝐹𝐹(𝑎𝑎) = ⟨𝑥𝑥⟩ ∶ 𝑎𝑎 ∈ 𝐴𝐴, 𝑥𝑥 ∈ 𝐺𝐺},
seen that using soft sets or soft groups provided a where {𝑥𝑥 ∈ 𝐺𝐺} is element of 𝑃𝑃(𝐺𝐺). That is to say, if
flexible qualification on that area. In our study, it will all the elements of (𝐹𝐹, 𝐴𝐴) are generated by any
be tried to apply soft structures to the cryptographic elements of 𝑋𝑋 of 𝑃𝑃(𝐺𝐺), then (𝐹𝐹, 𝐴𝐴) is a cyclic soft
problems and key exchange protocols. In this section, group over 𝐺𝐺.
the basic soft definitions will be given. If 𝐺𝐺 is a cyclic group, then (𝐹𝐹, 𝐴𝐴) is a soft cyclic
Definition 4.1 A pair (𝐹𝐹, 𝐸𝐸) is called a soft set group over 𝐺𝐺 since it has known that all subgroups of
over 𝑈𝑈 if and only if 𝐹𝐹 is a mapping of 𝐸𝐸 into the cyclic group are cyclic but the reverse is not always
set of all subsets of the set 𝑈𝑈. true.
Definition 4.2 Let (𝐹𝐹, 𝐴𝐴) be a soft set defined over Example 4.1 Let 𝐺𝐺 = 𝑆𝑆 3 be the symmetric group
the universe 𝑈𝑈. Then a soft matrix over (𝐹𝐹, 𝐴𝐴) is and 𝐴𝐴 = {𝑒𝑒, (12), (13), (23), (123)} the set of
denoted by [𝑀𝑀(𝐹𝐹, 𝐴𝐴)] is a matrix whose elements are parameters. If we construct a soft set (𝐹𝐹, 𝐴𝐴) over
the elements of the soft set (𝐹𝐹, 𝐴𝐴). Mathematically, 𝐺𝐺 such that 𝐹𝐹(𝑥𝑥) = {𝑦𝑦 ∈ 𝐺𝐺 ∶ 𝑦𝑦 = 𝑥𝑥𝑥𝑥, 𝑛𝑛 ∈ 𝑍𝑍} for
[𝑀𝑀(𝐹𝐹, 𝐴𝐴)] = 𝑚𝑚𝑖𝑖𝑖𝑖 where 𝑚𝑚𝑖𝑖𝑖𝑖 = 𝐹𝐹(𝛼𝛼) for some all 𝑥𝑥 ∈ 𝐴𝐴, then one can easily shows that (𝐹𝐹, 𝐴𝐴) is a
𝛼𝛼 ∈ 𝐴𝐴 [17,22]. soft cyclic group over 𝐺𝐺; however 𝐺𝐺 is not a cyclic
Definition 4.3 Let 𝐺𝐺 be a group and 𝐸𝐸 be a set of group [24].
parameters. For 𝐴𝐴 ⊆ E the pair (𝐹𝐹, 𝐴𝐴) is called a Theoretically, Diffie-Hellman Key Exchange
soft group over 𝐺𝐺 if and only if F(a) ≤ 𝐺𝐺 for all Protocol and Cyclic soft group can be combine as;
∈ 𝐴𝐴 , where 𝐹𝐹 is a mapping of 𝐴𝐴 into the set of all Let
subsets of 𝐺𝐺 [19]. {(𝑎𝑎𝑖𝑖 , ⟨𝑥𝑥⟩) ∶ 𝐹𝐹(𝑎𝑎𝑖𝑖 ) = ⟨𝑥𝑥⟩, 𝑥𝑥 ∈ 𝑋𝑋}
Definition 4.4 Considers the followings [19, 24]. be a soft subset of (𝐹𝐹, 𝐴𝐴) and let (𝐹𝐹, 𝐴𝐴) = ⟨𝑋𝑋⟩ be a
 714 On the Group Based Cryptography

cyclic soft group for each 𝑖𝑖 = 1, 2, … . . , 𝑛𝑛. 22, (1976), 644--654.

[9] K. H.Ko, S. J. Lee, J. H.Cheon, J. W. Han, J. Kang, and C.
After that, Alice chooses 𝑎𝑎1 , 𝑎𝑎2 , … . , 𝑎𝑎𝑛𝑛 and then
Park, New public-key cryptosystem using braid group, in
sends 𝑔𝑔𝑎𝑎 1 , 𝑔𝑔𝑎𝑎 2 , … , 𝑔𝑔𝑎𝑎 𝑛𝑛 to each Bobs. Advances in Cryptology - CRYPTO 2000 (M. Bellare,
ed.), Lecture Notes in Computer Science 1880 (Springer,
5. Conclusions Berlin, 2000) 166--183.
[10] E.Artin, The theory of braids, Annals of Math. 48 (1947)
As it seen there are many applications of group
101-126.
theory on public key cryptography and also all [11] E.Stickel, A new method for exchanging secret keys, in
cryptographic algorithms have some weaknesses. The Proc. Third International Conference on Information
main issue of public key cryptography is the key Technology and Applications (ICITA '05) (IEEE
Computer Society, Piscataway, 2005), 426-430.
exchange problem. In this study the most useful group [12] N. N. Thanh. "Group-based Public Key Cryptography."M.
based key exchange protocols were collected. As a Thesis University of Natural Science, VNU-HCM, 2004.
last word we are going to apply the theory of soft [13] P. Anandam, "Introduction to Braid Group
group on these protocols if they are applicable or not? Cryptography." documents from www.cs.washington.edu.
(2006).
If so, it will break fresh ground on cryptology. [14] P.Dehornoy, Braid-based cryptography, Contemporary
Mathematics 360 (2004), 5--33.
References [15] D. Kahrobaei, C. Koupparis, V. Shpilrain, Public key
[1] J. Kaliski, S. Burton, R. L. Rivest, and A. T. Sherman. "Is exchange using matrices over group rings. Groups,
the Data Encryption Standard a group?(preliminary Complexity, Cryptology 5, 97--115 (2013
abstract)." Advances in Cryptology---EUROCRYPT'85. [16] A. Mahalanobis "Are Matrices Useful in Public-Key
Springer Berlin Heidelberg, Cryptography?", International Mathematical Forum,
[2] K. W.Campbell, and M. J. Wiener, DES is not a group. In http://dx.doi.org/10.12988/imf.2013.310187, Vol. 8, no.
Advances in Cryptology---CRYPTO'92. Springer Berlin 39, 1939 - 1953, (2013).
Heidelberg (1993, January), pp 512-520. [17] S. Mondal and M. Pal, "Soft Matrices" Journal of
[3] M. Dehn, 1910: Uber die Topologie des Uncertain Systems Vol.7, No.4, p.254-264, Online at:
www.jus.org.uk (2013).
dreidimensionalRaumes, Math. Ann. 69, 137-168, 1914:
[18] D. Molodtsov, Soft set theory-first results, Computer
Die beidenKleeblattschlingen, Math. Ann. 75, 402-413, C.
and Mathematics with applications, vol.37, pp.19--31,
Cid, C. Mullan, Group theory in cryptography, in: C. M.
1999
Campbell, M. R. Quick, E. F. Robertson, C. M.
[19] H. Aktas, and N. Çağman, Soft set and soft groops,
Roney-Dougal, G. C. Smith and G. Traustason (editors),
Information Sciences, vol.177, pp.2726--2735, 2007.
Proceedings of Groups St Andrews 2009 in Bath Volume
[20] M.I. Ali, et al., On some new operations in soft set theory,
1, Cambridge University Press, (2011), 133--149.
Computer and Mathematics with Applications, vol.57,
[4] A.Myasnikov, V.Shpilrain and A.Ushako group-based
1547--1553, 2009.
Cryptography, Advanced Courses in Mathematics CRM
[21] X. Yin, Z. Liao "Study on Soft Groups", JOURNAL OF
Barcelona, Birkhauser, Basel, (2008).
COMPUTERS, VOL. 8, NO. 4, APRIL 20
[5] S. D. Hasapis and D. Panagopoulos, "Some aspects of [22] T.M. Basu, N.K. Mahapatra and S.K. Mondal, "Matrices
group-based cryptography", Journal of Applied Mathematics in soft set theory and their applications in decision
& Bioinformatics,vol.3,no.1,2013, ISSN:1792-6602 making problems", SAJM vol.2(2):126-143, ISSN
(print),1792-6939(online) Scienpress Ltd, (2013),83-97. 2251-1512, (2012).
[6] R.Rivest, A.Shamirand, L.Adleman,A method for [23] S. Nazmul and S. K.Samanta, “Soft topological soft
obtaining digital signatures and pulic-key cryptosystems, groups”, Mathematical Sciences, 6:66,
Communications of the ACM, 21, (1978), 120--126. http://www.iaumath.com/content/6/1/66, (2012).
[7] http://en.wikipedia.org/wiki/RSA_(cryptosystem), [24] H. Aktaş, Ş. Özlü, “cyclic soft groups and their
(2014). applications on groups”, Hindawi Publishing Corporation
[8] W.Diffie and M. Hellman, New directions in The Scientific World Journal Volume 2014, Article ID
cryptography, IEEE Transaction on Information Theory, 437324, 5 pages http://dx.doi.org/10.1155/2014/437324.

View publication stats