Modification Affine Ciphers Algorithm For Cryptography Password
Modification Affine Ciphers Algorithm For Cryptography Password
discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/315725688
CITATIONS READS
3 5,940
1 author:
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
A Novel Data Aggregation Methodology for Secure Data Gathering in Wireless Sensor Networks View
project
All content following this page was uploaded by Ajay Babu Sriramoju on 01 April 2017.
ABSTRACT
Computers as a means of storing and transmitting data, information, and confidential
documents are important and can often be easily accessed by people who are not
responsible. Security and confidentiality of data on computer networks today become a
very important issue and continues to grow. Some of the cases relating to computer
network security today become a job that requires handling fee and security has been
tremendous. Vital systems such as defense systems, banking systems and systems of many
users (multi-user) requires such a high level of security. This study aims to build a
prototype of data security (cryptography) for passwords using a modified method of affine
ciphers. Model analysis of cryptographic needs this password using State Transition
Diagram (STD).
1. INTRODUCTION
Cryptographic system for passwords can be built using a modified method of affine
ciphers efficient and effective way to secure data, information, and documents. The
application of the modification method of affine ciphers cryptosystems cryptography to
applications in a password is needed to make the computer cannot be opened by pirates
primarily by other users who do not have access rights (Septiarini and Hamdani, 2011). This
study aims to build data security (cryptography) for passwords using a modified method of
affine ciphers.
2. THEORIES
The word cryptography (Cryptography) come from the Greek word meaning hidden
Kryptos and graphein which means writing. Cryptography can be interpreted as the writing of
confidential or can be interpreted also as a science or art to learn how a data, information, and
documents are converted to forms particularly hard to understand (Luciano and Prichett,
1987; Menezes, 1996 in Munir, 2006; Schneier, 1996 in Munir, 2006; Munir, 2006;
Wirdasari 2008; Septiarini and Hamdani, 2011; Abraham and Shefiu, 2012). Cryptography
aims to maintain the confidentiality of data, information, and documents that can not be
known by a person not entitled to it (unauthorized person). Herryawan (2010) states there are
various systems that the intended use of passwords and different levels of confidentiality in
accordance with user requests, but in practice the user wants conveniences such as:
confidentiality Data, speed, accuracy, and cost. An encoded data called plaintext or cleartext
while the data was encrypted called ciphertext. The process is performed to convert plaintext
into ciphertext is called encryption (encryption) or Encipherment while the process of turning
ciphertext back into plaintext is called decryption (decryption) or decipherment (ISO 7498-2).
Cryptographic parameters required for the conversion process that is controlled by a key or
multiple keys.
Cryptography has now become one of the important conditions in the security of
information technology, especially in the delivery of secret messages. Secret message
delivery is very vulnerable to attacks carried out by a third party, such as wiretapping,
disconnection of communication, changing the message sent, and others. Cryptography can
improve security in sending messages or communications data by encrypting messages are
based on certain algorithms and key known only to the parties entitled to the data,
information, and documents.
The example of the testing process modification affine cipher algorithm looks as the
follows:
Encryption for passwords: AFC25W using a modified method of affine cipher produce
"UL0YJK", as shown in Table 1.
TABLE 1
Encryption "AFC25W" with modification Affine Cipher
Plaintext A F C 2 5 W
Mod. Plaintext W 5 2 C F A
X 22 31 28 2 5 0
Decryption functions written as follows: D (y) = 31 (y - 10) mod 36 where a-1 is the result of
the calculation is 31, b is 10, and m is 36. Decryption of ciphertext "UL0YJK" generate
password origin "AFC25W" as shown in Table 2.
TABLE 2
Decryption "UL0YJK" with modification Affine Cipher
Ciphertext U L 0 Y J K
Mod Ciphertext K J Y 0 L U
y 10 9 24 26 11 20
31(y- 10) 0 -31 434 496 31 310
31(y- 10) mod 36 0 5 2 28 31 22
Plaintext A F C 2 5 W
4. CONCLUSION
technique that shows that a functional prototype of the software is correct. This test does not
include alpha and beta testing.
REFERENCES
1. Abraham, O. dan Shefiu, G.O. 2012. An Improved Caesar Cipher (ICC) Algorithm,
International Journal of Engineering Science & Advanced Technology, Volume 2, Issue-
5.: 1199-1202
2. Ariwibowo, E. 2008. Aplikasi Pengamanan Dokumen Office dengan Algoritma
Kriptografi Kunci Asimetri Elgamal, Jurnal Informatika, Vol 2 No. 2.
3. Dey, S. 2012. SD-AREE : A New Modified Caesar Cipher Cryptographic Method
Along with Bit-Manipulation to Exclude Repetition from a Message to be Encrypted,
Department of Computer Science St. Xavier’s College [Autonomous] Kolkata, West
Bengal, India.
4. Goyal, D dan Srivastava, V. 2012. RDA Algoritm: Symmeric Key Algoritm, International
Journal of Information and Communication Technology Research, Volume 2 No. 4.
5. Hadi, A. 2011. Rancang Bangun Sistem Pengamanan Dokumen pada Sistem Informasi
Akademik Menggunakan Digital Signature dengan Algoritma Kurva Eliptik, ISO 7498-
2 : Security Architecture of OSI Reference Model.
6. Pressman, R.S. 1997. Software Engineering a Practitioner’s Approach, 4th edition,
McGraw-Hill International Editions, New York
7. Rahayu, T. P, Yakub, dan Limiady, I. 2012. Aplikasi Enkripsi Pesan Teks (SMS) pada
Perangkat Handphone dengan Algoritma Caesar Cipher, Seminar Nasional Teknologi
Informasi dan Komunikasi (SENTIKA) Yogyakarta.
8. Saroha, V, Mor, S dan Dagar, A. 2012. Enhancing Security of Caeser Cipher by
Double Columnar Transposition Method, International Journal of Advanced Research
Computer Science and Software Engineering, Volume 2, Issue 10.
9. Septiarini, A dan Hamdani. 2011. Sistem Kriptografi untuk Text Message Menggunakan
Metode Affine, Jurnal Informatika Mulawarman, Vol 6 No. 1.
10. Singh, A, Nandal, A dan Malik, S. 2012. Impementation of Caeser Cipher with Rail
Fence for Enhancing Data Security, International Journal of Advanced Research
Computer Science andSoftware Engineering, Volume 2, Issue 12.
11. Srikantaswamy, S. G dan Phaneendra, H. D. 2012. Improved Caesar Cipher with
Random Number Generation Technique and Multistage Encryption, International
Journal on Cryptography and Information Security (IJCIS), Vol 2 No. 4.
12. Bhoyar, Mayur Ramkrushna. "Home automation system via internet using Android
phone." InternationalJournal of Research in Science and Engineering. CSE Department,
JDIET, Yavatmal: 6.
13. Maulana, Bagoes, and Robbi Rahim. "GO-BACK-N ARQ APPROACH FOR
IDENTIFICATION AND REPAIRING FRAME IN TRANSMISSION DATA."
14. Nofriansyah, Dicky, and Robbi Rahim. "COMBINATION OF PIXEL VALUE
DIFFERENCING ALGORITHM WITH CAESAR ALGORITHM FOR
STEGANOGRAPHY."
15. Sriramoju Ajay, B. (2017). INTELLIGENT MOBILE APP FOR FINDING PATH AND
TRACKING POST PACKETS USING ANDROID PLATFORM. International Journal
Of Research In Science & Engineering, 3(2), 9. Retrieved from http://ijrise.org/home
16. Sriramoju Ajay, B. (2017). Investigation of Feasible Tourist Destinations using Android
Mobile App. International Journal Of Research In Science & Engineering, 3(2), 9.
Retrieved from http://ijrise.org/home
17. Babu, Sriramoju Ajay, and Namavaram Vijay. "Image Tag Ranking for Efficient
Matching and Retrieval." (2016).
18. Babu, Sriramoju Ajay, and Namavaram Vijay. "Design and Implementation of a
Framework for Image Search Reranking." (2016).
19. Babu, Sriramoju Ajay, and S. Shoban Babu. "International Journal of Research and
Applications Jan-Mar© 2016 Transactions 3 (9): 422-426 eISSN: 2349‒0020."