Sensitive Information and Data Leakage Prevention Using Secured Encryption Algorithm

Nowadays, protecting sensitive factual information from hackers when it is transmitted over the broad network to communicate around the world is a huge task. To provide secure online transactions, communication, and business, researchers are insisted to develop novel security techniques. One of these approaches is on the basis of encrypting a plaintext will be in ciphertext by applying some mathematical models. This paper suggested a modified Blowfish algorithm with Fermat’s Little Theorem to provide an additional layer of security for sensitive information while sending over a non-secure channel. The performance analysis of Modified Blowfish Algorithm and Fermat’s Little Theorem (BFLT) encryption algorithm reveals consumption of memory, time consumption for encrypting and decrypting by comparing with the standard encryption algorithm. According to the analysis, this proposed encryption algorithm provides significantly upper level of performance and security and BFLT can be used for real-time implementations

Download Full-text

An Improved Playfair Encryption Technique Using Fibonacci Series Generated Secret Key

International Journal of Engineering & Technology ◽

10.14419/ijet.v7i4.5.20104 ◽

2018 ◽

Vol 7 (4.5) ◽

pp. 347

Author(s):

Mohd Vasim Ahamad ◽

Misbah Urrahman Siddiqui ◽

Maria Masroor ◽

Urooj Fatima

Keyword(s):

Fibonacci Numbers ◽

Encryption Algorithm ◽

The Internet ◽

Sensitive Information ◽

Secret Key ◽

Fibonacci Series ◽

Random Keys ◽

Shared Information ◽

Cryptographic Techniques ◽

Share Information

With the technology advancements and easy availability of internet, every day millions of users share information electronically through emails, file sharing, e-commerce, etc. As, internet is highly vulnerable to various attacks, sending sensitive information over the Internet may be dangerous. One of the ways to protect the sensitive Information is using the cryptographic techniques. So, while sharing sensitive information over the Internet, it should be sent in encrypted form to prevent the access by unauthorized person. Encryption can be defined as the process of transforming information in such a manner that only authorized person can understand the shared information. In this paper, we have taken Playfair encryption algorithm for encryption and modified it by using Fibonacci series. Fibonacci series is used to generate a random key, which is used for encrypting the message in Playfair encryption algorithm. Using Fibonacci numbers and generating random keys provide significant security to shared information.

Download Full-text

Case Study

Privacy Concerns Surrounding Personal Information Sharing on Health and Fitness Mobile Apps - Advances in Information Security, Privacy, and Ethics ◽

10.4018/978-1-7998-3487-8.ch006 ◽

2021 ◽

pp. 145-162

Author(s):

Kylie Torres ◽

Andrew Stevenson ◽

Justin Hicks

Keyword(s):

Encryption Algorithm ◽

Sensitive Information ◽

Data Breach ◽

Dark Web ◽

The Way

Under Armour purchased a fitness app, MyFitnessPal, that suffered a data breach shortly after Under Armour acquired the app. This breach made customers usernames, emails, and passwords available and for sale on the dark web. Under Armour informed its users of the breach and handled the crisis in the way they saw fit. During the investigation, it was found that Under Armour used a weaker encryption algorithm than it should have to encrypt customers' sensitive information. The company is currently in a lawsuit over the breach with one MyFitnessPal user.

Download Full-text

An encryption algorithm for user's sensitive information resources in network database

Journal of Interdisciplinary Mathematics ◽

10.1080/09720502.2018.1495399 ◽

2018 ◽

Vol 21 (5) ◽

pp. 1255-1260 ◽

Cited By ~ 1

Author(s):

Bing Zhao ◽

Gaiwen Guo

Keyword(s):

Information Resources ◽

Encryption Algorithm ◽

Sensitive Information ◽

Network Database

Download Full-text

Subject Review: Comparison Between 3DES, AES and HiSea Algorithms

International Journal of Scientific Research in Science Engineering and Technology ◽

10.32628/ijsrset196625 ◽

2019 ◽

pp. 97-103

Author(s):

Shaimaa Khudhair Salah ◽

Waleed Rasheed Humood ◽

Ahmed Othman Khalaf ◽

Zainab Khyioon Abdalrdha

Keyword(s):

Encryption Algorithm ◽

The Internet ◽

Sensitive Information ◽

Information Protection ◽

Sources Of Information ◽

Secret Key ◽

High Level ◽

Security Communication

Security is one of the main sources of information protection, especially sensitive information that is transmitted over the Internet. Encryption is one of the most important elements used, which is an effective and necessary element to provide high-level security communication between different entities by transmitting unclear and encrypted information that does not allow unauthorized person to access, the method of choosing the appropriate and correct encryption algorithm is important to provide a secure connection that provides a more efficient and accurate encryption system. In this paper, we will review the algorithms (Triple DES, AES & HiSea) for secret key encryption that are most commonly used for this type of encryption.

Download Full-text

Significant role of the specific prime number p = 257 in the improvement of cryptosystems

Notes on Number Theory and Discrete Mathematics ◽

10.7546/nntdm.2020.26.4.213-222 ◽

2020 ◽

Vol 26 (4) ◽

pp. 213-222

Author(s):

Hana Ali-Pacha ◽

◽

Naima Hadj-Said ◽

Adda Ali-Pacha ◽

Özen Özer ◽

...

Keyword(s):

Finite Field ◽

Prime Number ◽

Finite Fields ◽

Significant Role ◽

Encryption Algorithm ◽

Sensitive Information ◽

Modulo P

Cryptology is the significant science which is inseparable from the means of communication of secrets. In a safe manner, it has the main objective of transmitting (potentially sensitive) information between two interlocutors. One distinguishes mainly two “dual” disciplines within cryptology: (a) cryptography, which is interested in the security of information. (b) cryptanalysis, which seeks to attack it. One have a starting set of 256 elements, we add a new element to this set to form a set of 257 elements. In this paper, we consider a finite field that contains 257 elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are given by the integers modulo p when p is a prime number. For our case ℤ/pℤ, p = 257. We apply it to affine ciphers and show that this cipher looks like a permutation cipher. The idea based on this result, is to use the affine ciphers with the modulo 257 (as an initial permutation) in any specific algorithm of ciphering. Besides, one finishes with the decryption affine with the modulo 257 like an inverse permutation. This is to significantly increase the security of the specific encryption algorithm and to lengthen the 16-bits encryption key.

Download Full-text