Excellence in Research and Innovation for Humanity

International Science Index


Select areas to restrict search in scientific publication database:
10007314
Secure Hashing Algorithm and Advance Encryption Algorithm in Cloud Computing
Authors:
Abstract:
Cloud computing is one of the most sharp and important movement in various computing technologies. It provides flexibility to users, cost effectiveness, location independence, easy maintenance, enables multitenancy, drastic performance improvements, and increased productivity. On the other hand, there are also major issues like security. Being a common server, security for a cloud is a major issue; it is important to provide security to protect user’s private data, and it is especially important in e-commerce and social networks. In this paper, encryption algorithms such as Advanced Encryption Standard algorithms, their vulnerabilities, risk of attacks, optimal time and complexity management and comparison with other algorithms based on software implementation is proposed. Encryption techniques to improve the performance of AES algorithms and to reduce risk management are given. Secure Hash Algorithms, their vulnerabilities, software implementations, risk of attacks and comparison with other hashing algorithms as well as the advantages and disadvantages between hashing techniques and encryption are given.

References:

[1] Marc Stevens (June 2012). "Attacks on Hash Functions and Applications" - PhD thesis.
[2] Schneier on Security–Cryptanalysis of SHA–1 http://www.schneier.com 17th July, 2016.
[3] Dmitry Khovratovich, Christian Rechberger & Alexandra Savelieva. "Bicliques for Preimages: Attacks on Skein-512 and the SHA-2 family". IACR Cryptology.
[4] National Institute on Standards and Technology Computer Security Resource Center, NIST's Policy on Hash Functions.
[5] Diffie, Whitfield; Hellman, Martin E. "Exhaustive Cryptanalysis of the NBS Data Encryption Standard". Computer. 10 (6): pp 74–84.
[6] Konheim. Computer Security and Cryptography. pp. 301.
[7] William E. Burr, "Data Encryption Standard", in NIST's anthology “A Century of Excellence in Measurements, Standards, and Technology”: A Chronicle of Selected NBS/NIST Publications, 1901–2000 Link: http://nvl.nist.gov/pub/nistpubs/sp958-lide/250-253.pdf - 1st July, 2016.
[8] Schneier. Applied Cryptography (1st edition). Page number - 271. Link - https://www.schneier.com/books/applied_cryptography/1errv159.html
[9] "Efficient software implementation of AES on 32-bit platforms". Lecture Notes in Computer Science: 2523. 2003.
[10] Bruce Schneier, AES Announced, October 15, 2000.
[11] Nikolic, Ivica (2009). "Distinguisher and Related-Key Attack on the Full AES-256".Advances in Cryptology – CRYPTO 2009. Springer Berlin / Heidelberg. pp. 231–249.doi: 10.1007/978-3-642-03356-8_14. ISBN 978-3-642-03355-1.
[12] Biham, Eli and Shamir, Adi (1991). "Differential Cryptanalysis of DES-like Cryptosystems". Journal of Cryptology. 4 (1): 3–72. doi:10.1007/BF00630563.
[13] New Comparative Study between DES, 3DES and AES within Nine Factors. Journal of computing, volume 2, issue 3, march 2010, issn 2151-9617. Retrieved 2012-12-01. Link - http://arxiv.org/pdf/1003.4085.pdf
[14] "Triple DES Encryption". IBM. Retrieved 2014-05-17.
[15] A Classical introduction to cryptography by Serge Vaudenay - Introduction
Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007