|
|
|
|
CONTRIBUTORS:
|
|
|
CONFERENCE NAME:
|
|
|
CONF. LOCATION:
|
Kanyakumari
|
|
CONFERENCE YEAR:
|
2012
|
|
PUB TYPE:
|
Conference Presentation
|
|
SUBJECT(S):
|
Cryptography, Finite Field Arithmetic
|
|
DISCIPLINE:
|
Computer Science
|
|
HTTP:
|
http://www.icect.org/
|
|
LANGUAGE:
|
English
|
|
PUB ID:
|
103-501-505
(Last edited on
2012/04/11 21:31:08 GMT-6)
|
|
SPONSOR(S):
|
|
|
ABSTRACT:
DNA Cryptography in spite of being one of the most
electrifying forms of cryptography, suffers from the dearth of
the number of keys. In its simulation a plain text is mapped
with a particular codon and decrypted by the mapping table.
In the work proposed a novel method of DNA cryptography
has been proposed and implemented which makes use of finite
field arithmetic to make the cryptographic system comparable
to the best of the cryptographic techniques and still retaining
the blend of the nature. The work proposed has been
implemented and analyzed. The results were encouraging. The
work opens the door of DNA cryptography to refined finite
field arithmetic and promises providing a new methodology
which overcomes most of the shortcomings of the existing ones.
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
0
|
|
References
|
|
0
|
|
Comments
|
|
0
|
|
Quality
|
|
1/6.00
|
|
Interest
|
|
1/5.00
|
|
View(er)s
|
|
2/127
|
|
|
|
|
|
|
| Prev |
Next |
|
