Académique Documents
Professionnel Documents
Culture Documents
Page 1
Image
From Quick Submit (Quick Submit) Processed on 09-May-2012 5:42 AM PDT ID: 248361119 Word Count: 1843 Similarity Index 63% Similarity by Source Internet Sources: 11% Publications: 62% Student Papers: 12%
sources: 1
51% match (publications) C.H. Lin. "A new public-key cipher system based upon the diophantine equations", IEEE Transactions on Computers, 1995
2% match (student papers from 06/10/03) Submitted to CSU, San Jose State University on 2003-06-10
1% match (publications) Morgos, Lucian. "Considerations about the Modeling of Software Defined Radio for Mobile Communications Networks", Journal of Electrical & Electronics Engineering/18446035, 20090601
1% match (student papers from 05/04/11) Submitted to Higher Education Commission Pakistan on 2011-05-04
10
11
1% match (publications) Shaarawy, M.. "An improved public-key cipher system based upon diophantine equation",
file://localhost/D:/raport_plagiat_mang.html
09.05.2012 15:48:40
Page 2
12
< 1% match (publications) Zhong Hong. "An Efficient (t, n)-Threshold Multi-Secret Sharing Scheme", First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008), 01/2008
13
14
< 1% match (publications) Cusick, T.W.. "Cryptanalysis of a public key system based on Diophantine equations", Information Processing Letters, 19951027
paper text:
PUBLIC-KEY CRYPTOSYSTEM BASED ON THE DIOPHANTINE EQUATIONS Ioan Mang, Erica Mang
Engineering and Information Technology, 1, Universitatii St., 410087 Oradea, Romania, E-mail: emang@keysys .ro Abstract This study analyses the
mathematical aspects of diophantic equations and the
potential of using them in cipher public-key systems. There are also presented the algorithms written in C language that were used for implementing such a system Keywords: public-key algorithms, Diophantine equation, cryptosystem, encryption. I. INTRODUCTION
1In this paper, a new public-key cipher scheme is proposed. By the use of
our scheme, the generating steps of keys are simple. Both the encryption and decryption procedures can be completed efficiently. Our cipher scheme is based upon the Diophantine equations. In general, a Diophantine equation is defined as follows: We are given a polynomial equation f(x
1 ,x 2 ,...,x n ) -
solutions [6]. Throughout this paper, we shall assume that the solutions are nonnegative. For instance, consider the following equation: 3x 1
solution is (x
file://localhost/D:/raport_plagiat_mang.html
09.05.2012 15:48:40
Page 3
solution or not. In and, it was shown that the Hilbert problem is undecidable for polynomials with degree 4. It was shown in that the Hilbert problem is undecidable for polynomials with 13 variables [1]. Gurari and Ibarra also proved that several Diophantine equations are in NP- complete class.
integers in the range of [0, w]. Let w = 2 b - 1, where b is some positive integer. Assume that a sending message M with length NB bits is broken up into n pieces of submessages, namely m1, m2, and mn. Each submessage is of length b bits. In other words, we can represent each submessage by a decimal number mi and mi in D. Suppose that n pairs of integers (q 1 , k 1 ), (q 2 , k 2 ), ... and (q n , kn) are chosen such that the following conditions hold: 1) qi's are pairwise relative primes; i.e. 1. (q i ,q j ) = 1 for
i j. 2. 2) k 1 >
2w for i = 1,2, ..., n. 3. 3) qi > kiw(qi mod ki), and qi mod ki 0, for i
11, 2, ..., n. These n integer pairs (qi, ki)'s will be kept secret and used to
decrypt messages. For convenience, we name the above three conditions the DK-conditions since they will be used as deciphering keys. Note that for the generating of pairwise relatively primes, one can consult. Furthermore, the following numbers are computed. First, compute Ri = qi mod ki and compute Pi's such that two conditions are satisfied: 1) Pi mod qi = Ri, and 2) Pj mod qi = 0 if i = j. Since qu's are pairwise relatively primes, one solution for Pi's satisfying the above two conditions is that Pi = Qibi with Qi
qi i j and bi
1is chosen such that Qibi modqi =Ri. Since Qi and qi are relatively prime, bi's
can be found by using the extended Euclid's algorithm. Note that the average number of divisions performed by the extended Euclid's algorithm for finding bi is approximately 0.843. ln (qi) + 1.47. Secondly, compute
Ni = qi /(kiRi )
file://localhost/D:/raport_plagiat_mang.html
09.05.2012 15:48:40
Page 4
where Q qi (3) i 1
1That is, we have a vector S = (s1, s2, ..., sn) with each
conducting a vector product between M = (m1, m2, ..., mn) and S = (s1, s2, ..., sn); i .e., n C = E(S ,M) = M*
S = misi (4) i 1
product operation. Conversely, the ith component mi, in M can be revealed by the following operation: mi = D(( qi,ki ),C)
= kiC/ qi
1for i = 1, 2, ..., n (5) Theorem 2.1 shows that (5) is the inverse function of (4).
The following lemmas are helpful in the proof of the theorem. Lemma 2.1: Let a and b be some positive integers where b > a. Then for all
x,
+ 1). We have ac < ax/(b + a). (6) On the other hand, if x ab / (b-a), then (b-a) x ab; that is,
1Let mi's, ki's and qi's be chosen such that the DK - conditions are satisfied. Let Ri = qi mod ki. Then
1It can be easily seen that the following two inequalities hold: and < iRim i(qi /
(kiRi)
1Furthermore, the right-hand side of (13) is identical to m i and that of (12) is mi kiRimi / qi . On the other hand, since mi is an integer and kiRimi / qi <1, the
right-hand side in
=mi.
file://localhost/D:/raport_plagiat_mang.html
09.05.2012 15:48:40
Page 5
1Furthermore, the right-hand side of (13) is identical to m i and that of (12) is mi kiRimi / qi . On the other hand, since mi is an integer and kiRimi / qi <1, the
(14) i kiRimi / qi
conditions. Let the vector S be computed by applying (1). Then (3) is the inverse function of (2). that is, a
steps. First, from (1), define si = PiNi' we have a vector Let s = (s1,s2,...,sn); i.e., si =
x. (7) C' = M*S = m m i 1 misi i1 miPiNi. (15) Combining (6) and (7), we have that a Lemma 2.2: Let Ri = qi mod ki. Then x / b < x if x ab / (b-a). (8) kiRimi qi /(kiRi) mod kiqi = kiRimi qi /(kiRi) (9) Proof: Let a = Ri mi, b + ki Ri,
1and x = qi. Since qi > ki Ri w, we know that qi > ki Ri2 mi / (Ri (ki - mi)). That is, x
Rimi qi /(kiRi) < qi. Therefore, ki Ri mi qi /(kiRi) mod ki qi = ki Ri mi qi /(kiRi) (10) Lemma 2.3: Since
Pimodqi=qimodki=Ri;and
kiqi = (ki i 1 mi Pi Ni )mod kiqi= =kimiRi qi /(kiRi )modkiqi. (16) Furthermore, by Lemma 2.2, kimiRi qi /(kiRi ) mod kiqi = kimiRi qi /(kiRi ) (17) That is, kiC mod kiqi = kimiRi qi /(kiRi )
kiC=yikiqi+kimiRi qi /(kiRi ) . (18) for some integers yi. Moreover, Hence kiC'/ qi yiki kiC/qi=yiki+kimiRi qi / (kiRi ) /qi. (19) yiki kimiRiqi/(kiRi) kimiRi qi/(kiRi) /qi By applying Lemma 2.3, we have Thus Second, let then iC' / q i / q i (20) k = yiki + mi. (21) mi=modki. (22) n Qqi. (23) i 1 n C mod Q = ( i 1 m i si ) mod Q = ((m 1 s 1
file://localhost/D:/raport_plagiat_mang.html
09.05.2012 15:48:40
Page 6
+ ... n + mn(sn
= C mod Q. i 1 That
zQ)/ qi mod ki = = ( k iC' / qi kizQi ) mod ki = mod ki (24) Therefore, a vector n Q qi (27) i
131 S=(s 1 ,s 2 , . . . ,s n
7(q 1 ,k 1 ), (q 2 ,k 2 ), ..., (q n ,k n
) are
M = (m 1 , m 2 ,...,m n ), where mi
file://localhost/D:/raport_plagiat_mang.html
09.05.2012 15:48:40
Page 7
motivation of this attempt is trying to use real numbers for its dense property. However, if real numbers are used as keys, several disturbing problems, such as representation and precision will be encountered. With the help of integer functions, the possibility of using an integer as a key is increased significantly. That is, for a cryptanalyst who tries to break the cipher, he has to conduct an exhaustive search on a long list of integer numbers.
In other words, mi= k modki. iC' / qi III. THE CONSTRUCTION OF THE CRYPTOSYSTEM In this section, the
DK-conditions are satisfied. Afterward, and Q (25) q j j i Ni qi /(ki (qi modki )) (26) are computed, and bis are integers chosen
Fig.
Fig.
file://localhost/D:/raport_plagiat_mang.html
09.05.2012 15:48:40
Page 8
Algorithms, second ed. Reading, MA: Addison-Wesley, (1980). [2] D.E. Knuth: The Art of Computer Programming. Vol. 2: Seminumerical Algorithms, 2nd ed. Reading, MA: Addison-Wesley, (1981).
[3] S
(1987). [4]
[5]
9L.J. Hoffman: Modern Methods for Computer Security and Privacy, second edition, Printice -Hall,
file://localhost/D:/raport_plagiat_mang.html
09.05.2012 15:48:40