Refine your search
Collections
Co-Authors
Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Disina, Abdulkadir H.
- Enhanced Caeser Cipher to Exclude Repetition and Withstand Frequency Cryptanalysis
Abstract Views :338 |
PDF Views:0
Authors
Affiliations
1 Department of Information Security, UniversitiTun Hussein Onn Malaysia, Batu Pahat, MY
1 Department of Information Security, UniversitiTun Hussein Onn Malaysia, Batu Pahat, MY
Source
Journal of Network and Information Security, Vol 2, No 1 (2014), Pagination: 7-13Abstract
Cryptography is the art of encoding messages into an unreadable form from a sender and re-transforming back to its readable form at the receiver end. This is an enhanced Caesar cipher against frequency analysis using bidirectional shift. This algorithm encrypts message bit by bit or character by character (stream cipher) and uses one key ideology (symmetric key cipher), the sender encrypts the message before transmitting and the receiver decrypts upon receiving using the same key as the one used for the encryption. It shifts the plain text characters to different direction which eliminates repetition of characters in the cipher text. Previous versions of Caesar cipher hadonly 26 English alphabets to be encrypted, which the attacker knew that there were only 26 choices to choose from, to determine the plain text. And when the alphabet of the same type are encrypted, they will have the same symbol representing each, which gives hint to attacker on how to break it by using frequency cryptanalysis. The enhanced method (Enhanced Caesar cipher) has 95 characters as digital messages as against 26 alphabets. Based on this method, the sender will transposition the bits in the message according to their sequence arrangement (odd and even position) to shift the characters in the odd position to the left and characters in the even position to the right side, based on the key given by the user, as the key to both shifts. Shifting the plain text to different directions mitigates the problem of repetition which the previous version suffers from. To make decryption more difficult, each character will switch position with the next to randomize their arrangement. The cipher was successfully developed and working accurately. It was developed on java platform using java eclipse IDE and NETBEANS IDE 7. 1. 2. It has successfully passed all the tests and proven its accuracy obtaining the result of 100% repetition free. Thus, the proposed method is highly resistant to frequency analysis. This provides more security than the earlier versions and it serves as an option to be integrated with other algorithms to strengthen the security.Keywords
Caesar Cipher, Cryptography, Repetition Exclusion, Encryption, Decryption, Shift, Switch, Symmetric-Key Cipher, Key Generation.References
- Ascii Characters and Table. Retrieved from http://www.asciitable. com/(accessed on August 21, 2013).
- Babu, R., Abraham, G. & Borasia, K. (2012). A review on securing distributed systems using symmetric key cryptography. International Journal of Advances in Science and Technology, April, 4(4), 1-7.
- De, P. S. & Maiti, P. (2013). DEDD symmetric-key cryptosystem. International Journal of Advanced Computer Research, March, 3(8), 171-176.
- Dey, S. (2012a). An Integrated Symmetric Key Cryptographic Method- Amalgamation of TTJSA Algorithm, Advanced Caesar Cipher Algorithm, Bit Rotation and Reversal Method: SJA Algorithm. India, West Bengal: Department of Computer Science, St. Xavier's College.
- Dey, S. (2012b). SD-AREE: A New Modified Caesar Cipher Cryptographic Method Along with Bit Manipulation to Exclude Repetition from a Message to be Encrypted. India, West Bengal: Department of Computer Science St. Xavier's College.
- Goyal, D. & Srivastava, V. (2012). RDA Algortihm: Symmetric Key Algorithm. International Journal of Information and Communication Technology Research, 2(4), 342-347.
- Kumar, A., Varshney, A. K. & Kumar, P. (2012). PA substitution Cipher. International Journal of Engineering Research & Technology, December, 1(10), 1-4.
- Sharma, A., Bhatnagar, A., Tak, N., Sharma, A., Avasthi, J. & Sharma, P. (2012). An approach of substitution method based on ascii codes in encryption technique.
- International Journal of Advanced Studies in Computers, Science & Engineering, 1(3), 1-7.
- Stallings, W. (2006). Cryptography and Network Security 4/E., Pearson Education India. Retrieved from http://www.pearsonhighered.com/educator/product/Cryptography-and-Network-(accessed on September 1, 2013)
- An Enhanced UPC Mod 10 Check Digit Method
Abstract Views :349 |
PDF Views:0
Authors
Affiliations
1 Department of Information Security, UniversitiTun Hussein Onn Malaysia, Batu Pahat, MY
1 Department of Information Security, UniversitiTun Hussein Onn Malaysia, Batu Pahat, MY
Source
Journal of Network and Information Security, Vol 2, No 1 (2014), Pagination: 39-44Abstract
The advent of check digit methods has aided the detection of errors while computing data into an information system. Prominent check digit methods such as Universal Product Code (UPC), International Standard Book Number (ISBN-10), Luhn and Verhoeff check digit methods are widely used in detecting errors. This research will focus on the current UPC method as it is used widely around the world. The current UPC method does not effectively detect all types of errors. Thus, failure to detect errors can lead to undesired consequences like purchasing a wrong item or letting perpetrators to get away with their crimes. This paper examines the limitations of the UPC check digit method and proposes the idea of a double check digit method which produces two check digits. The proposed method is an enhancement of the current UPC modulus 10 check digit method. A comparative test was conducted to compare the ability of the proposed method and the current UPC method in detecting errors. However, results have shown that the proposed method has an average of 95.75 accuracy of detecting all tested errors as compared to the current UPC which detects 65% of tested errors respectively. Thus, the proposed method is more efficient than the current UPC check digit method in detecting errors.Keywords
Double Check Digit, Interdependence, Errors.References
- Chen, Y., Niemenmaa, M., Vinck, A. J. & Gligoroski, D. (2012). On Some Properties of a Check Digit System. In IEEE International Symposium on Information Theory Proceedings. (pp. 1563-1567).
- Damm, M. (2000). Check digit systems over groups and anti-symmetric mappings. Archivder Mathematik, 75(6), 413-421.
- Gallian, J. A. (1996). Error detection methods. ACM Computing Surveys, 28(3), 504-517.
- Gallian, J. A. (1991). The Mathematics of Identification numbers.College Mathematics Journal, 22(3), 194-202.
- Guidelines: IBAN Implementation in Pakistan.(2012). Retrieved from http://www.sbp.org.pk. (accessed on September 29, 2013). International Bank Account Number (IBAN) Standard for the Kingdom of Bahrain (2011). Retrieved from http://www.cbb.gov.bh.(accessed on September 29, 2013). Khaled, A. S. (1998). Detecting substitutions and transpositions of characters. The Computer Journal, 41(4), 270-277.
- Khan, Q., Butt, M. A., Zaman, M. & Asger, M. (2013). A novel approach based information integrity modeling. International Journal Engineering Science & Innovative Technology, January, 2(1), 210-215.
- Kamaku, W., Mwathi, C. & Kivunge, B. (2012). Limitations in the Convectional ISBN-10 CODE.
- American International Journal of Contemporary Research, February, 2(2), 150-152.
- Siddharth, A. (2012). Error Detection in Numeric Codes, 17(7), 653. Resonance-Heidelberg.
- Verhoeff, J. (1969). Error Detecting Decimal Codes. Amsterdam: The Mathematical Centre.