Beruflich Dokumente
Kultur Dokumente
Volume: 4 Issue: 3
ISSN: 2321-8169
502 - 506
_______________________________________________________________________________________
Keywords- Elliptic curve, Encryption, Decryption, Knapsack, Unicode, Amazigh character, Data Matrix.
__________________________________________________*****_________________________________________________
I.
INTRODUCTION
CRYPTOGRAPHIC TERMINOLOGY
_______________________________________________________________________________________
ISSN: 2321-8169
502 - 506
_______________________________________________________________________________________
- Confidentiality: This means that the secrecy of the data
being exchanged by the communicating parties is maintained,
i.e., no one other than the legitimate parties should know the
content of the data being exchanged.
- Authentication: It should be possible for the receiver to
ensure that the sender of the message is who he claims to be,
and the message was sent by him.
- Integrity: It provides a means for the receiver of a
message to verify that the message was not altered in
transit. It checks originality of message.
- Non-repudiation: The sender of a message should not be
able to falsely deny later that he sent the message, and
this fact should be verifiable independently by an
independent third-party without knowing too much about
the content of the disputed message.
Security protocols realize the security objectives through the
use of appropriate cryptographic algorithms.
Security
objectives thus provide trust on the Web. They are realized
through the use of cryptographic algorithms which are
divided into two categories depending on their characteristics:
Symmetric algorithms and Asymmetric algorithms.
III.
BACKGROUND DETAIL
_______________________________________________________________________________________
ISSN: 2321-8169
502 - 506
_______________________________________________________________________________________
C. Unicode
Unicode is most popular encoding scheme that has led to
internationalization and localization of computer software. It
implemented successfully in most recent technologies like xml,
java programming language and Microsoft .net framework.
Unicode has several character encoding forms represented as:
- UTF-8: Uses one byte to encode the characters. It is widely
used in HTML and similar protocols over Internet.
- UTF-16: Uses two bytes to encode the most commonly used
characters.
- UTF-32: It is the simplest encoding form, which is capable of
representing every character as one number. It is a preferred
encoding form for Unix Platforms.
In general, each Amazigh character is encoded with particular
integer called code point [14]. The standard understanding of
code points in the Unicode Standard is to refer code point as
their numeric value assigned in hexadecimal, with a U+
prefix.
With the encoding system, Unicode characters can be used on
computer. Amazigh characters are encoded in the Unicode
range U+2D30 to U+2D7F. In general, there are 55 defined
characters [15, 16].
IV.
PROPOSED METHODOLOGY
50
40
Y_Axis
30
20
M=
M 11
M 21
M 31
M 12
M 22
M 32
M 1m
M 2m
M 3m
10
0
0
10
20
30
40
50
60
X_Axis
504
IJRITCC | March 2016, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
ISSN: 2321-8169
502 - 506
_______________________________________________________________________________________
The non-singular matrix A is selected as
1
1
1
A=
1
2
2
VI.
1
2
3
PERFORMANCE COMPARISON
Alg[20]
Our method
Encryption time
27.3
25.4
13.03
Decryption time
33.6
30.11
19.3
(24, 9)
Q=
35
C=
0
1
0
0
1
0
0
1
0
1
0
0
0
1
1
0
0
1
0
1
0
1
0
0
0
0
1
1
0
1
1
0
0
1
0
1
1
0
1
0
0
1
0
0
1
1
1
1
0
1
0
1
1
1
1
1
0
0
1
1
1
1
0
1
0
1
0
0
1
0
0
0
0
1
0
0
1
0
1
1
0
0
1
0
0
1
1
0
0
0
1
1
1
1
1
0
0
1
1
0
0
0
1
1
0
0
1
1
1
0
1
1
0
1
1
0
0
0
1
1
30
25
Encryption time
20
Decryption time
15
10
5
0
Alg [12]
Alg[20]
Our method
Algorithm s
_______________________________________________________________________________________
ISSN: 2321-8169
502 - 506
_______________________________________________________________________________________
Attack 2: Suppose an adversary attempts to decrypt the
message M from the cipher text without knowing the
senders private key.
Proof: In attack 2, suppose an adversary attempts to decrypt
the original message M then he has to know two things for
applying the reverse knapsack, 1) the knapsack vector
generation series using points on elliptic curve and 2) n value
for generating the knapsack values. These two things are
unique for every user. So, the adversarys attempt of applying
the reverse knapsack will not work. So, attack 2 is not possible
in the proposed method.
VIII.
[11]
[12]
[13]
CONCLUSION
[14]
[15]
[16]
[17]
[18]
[19]
REFERENCES
[1] S. Maria Celestin Vigila and K. Muneeswaran, Implementation
of Text based Cryptosystem using Elliptic Curve Cryptography,
IEEE, 2009, pp. 82-85.
[2] R. Balamurugan, V. Kamalakannan, D. Rahul Ganth and S.
Tamilselvan, Enhancing Security in Text Messages Using
Matrix based Mapping and ElGamal Method in Elliptic Curve
Cryptography, International Conference on Contemporary
Computing and Informatics, IEEE, 2014, pp. 103-106.
[3] O. Srinivasa Rao and S. Pallam Setty, Efficient Mapping
methods for Elliptic Curve Cryptosystems , International
Journal of Engineering Science and Technology, Vol. 2, No. 8,
2010, pp. 3651-3656.
[4] F. Amounas and E. H. El Kinani, Fast Mapping Method
based on Matrix Approach for Elliptic Curve Cryptography,
International Journal of Information & Network Security, Vol.1,
No.2, 2012, pp. 54-59.
[5] Fatima Amounas, Enhancing Robustness of Encrypting
Amazigh Alphabet based ECC using Scrambling Method,
International Journal of Engineering and Innovative Technology,
Vol 5, Issue 3, 2015, pp. 138-142.
[6] Ali Rachidi and Mustapha Eddahibi, An Amazigh Geo-cultural
Information System, International Journal of Emerging
Technology and Advanced Engineering, Vol 4, Issue 8, 2014,
pp.10-14.
[7] Rahat Afreen and S.C. Mehrotra, A Review on Elliptic curve
Cryptography for Embedded Systems, International Journal of
Computer Science and Information Technology, Vol. 3, No. 3,
2011, pp.84-103.
[8] Darrel Hankerson, Alfred Menezes and Scott Vanstone, Guide
to elliptic curve cryptography, Springer-Verlag, 2004.
[9] Andrej Dujella, Applications of elliptic curves in public
key cryptography, Basque Center for Applied Mathematics
and Universidad del Pais Vasco / Euskal HerrikoUnibertsitatea,
Bilbao, 2011.
[10] Shabnoor Qureshi and Somesh Dewangan, Prospective
Utilization of Elliptic Curve Cryptography for Security:
[20]
506
IJRITCC | March 2016, Available @ http://www.ijritcc.org
_______________________________________________________________________________________