Nt1310 Unit 5 Final Report

Public and private key is an encryption technique used to secure data. Explain the operation and use of any encryption technique from the list below.

To encrypt the document with EFS, I right clicked on the document and selected properties. From there, I navigated to the advanced tab and checked “Encrypt contents to secure data”

With the introduction of information technology advancement into the hospital health care system, we must embrace in this technology and must ensure that we have a more efficient and secure system. This will allow us to create measures that will allow us to protect electronic protected health information (ePHI). All data that is being transmitted on any open networks will be protected from any cyber attackers or unauthorized personnel. In order to protect this data, any ePHI data will be sent by encrypting the data to ensure that in the event that it is intercepted it

The gpg2 is the GnuPG freeware that implement OpenPGP as follow the standard RFC4880. This application allows users to encrypt and sign data signature for communication by using asymmetric cipher (The GNU privacy guard, 2015). This means that, they are using 2 keys in the operations. The first key is using for encrypt, public key, the another key is using for decrypt, the private/secret key. The gpg2 example that use with the targeted file are show on below with example of command line and also show on Figure 8 on appendix

This paper will take an in-depth look at the specifications of MD6 hashing algorithm by introducing the readers to the design, efficiency, security, compatibility of MD6.

As soon as this process is complete, your document or email will be encrypted with a strong key of 2048bit in key size. The email or document can be saved off/lost or stolen but will remain protected regardless if it falls in the wrong hands.

Due to the rapid and extensive growth of electronic publishing industry, data can now be distributed much faster and easier. Unfortunately, engineers still see technical challenges in discouraging unauthorized copying and distributing of electronic documents. Digital Watermarking represents an effective method

To ensure privacy in Controlled Content Distribution in Peer-to-Peer Networks through the use of advanced cryptography features of group signatures.

Yong Feng et al, in 2009,the author proposed a new invertible two-dimensional chart, shouted Line chart, for picture encryption and decryption. It charts a picture to an array of pixels and next, charts it back from the array to alike sized image. A Line chart consists of two submaps: the left Line chart and the right Line chart that are utilized for picture encryption and decryption. In order to vanquish the shortcoming of standard picture encryption ways established on two-dimensional (2-D) charts that can be utilized merely for permutation, this paper presents a novel picture encryption way established on the Line charts, that can present two procedures of picture encryption simultaneously, permutation and substitution, employing the alike maps. The counseled picture encryption does not have data loss. Supplementary gains contain that it is fast and there is no check on the length of protection key that is desirable for disparate protection requirements. Simulation aftermath display the effectiveness of the new picture encryption scheme. [20]

Here are two ways to encrypt the voice signal: digital and analogue encryptions. In case of digital encryption, at first the analog signal must be digitized. The resulting signal is compressed to produce stream of bits at an adequate bit rate. Then this stream is encrypted and transferred by channel. The analogue encryption, is also known as “voice scrambling” or “speech scrambling.” This way operates on the samples of voice themselves without the need for digitization and compression. The purpose of voice encryption is to convert the voice signal from the original form into unintelligible voice signal, making it difficult to decrypt this signal when the key is unknown. Note that this chapter will use “Voice” and “Speech” interchangeably.

In the version of security analysis and experimental results our proposed encryption scheme is fast and on the other hand provides good security and adds very less overhead on the data, this today is the requirement of most of the multimedia applications.

The Java Cryptography Extension (JCE) provides a standard framework and implementations for data encryption, the key generation, key agreement and the message authentication Code algorithms. The encryption techniques

The algorithms are called Keygen, Encode, and Distance. Keygen is a probabilistic algorithm that is ran by a client to setup the scheme. Keygen generates a secret key along with a distance threshold and passes it to the Encode algorithm. With Encode, a deterministic algorithm, plaintext is encoded with the previous key by the client. During the last phrase, Distance, the server takes two encodings, one for plaintext and the other for distance to carry out the encryption. The authors went on to present two efficient implementations of DPE, one for dense media types, such as images, and the other for sparse media, such as text. Both implementations proved a secure realization of DPE. Without DPE MIE would be useless, as the users information would still be leaked.

Abhilasha Sharma, et.al. [21], The proposed watermarking technique is based on two TD techniques, DCT and DWT. In embedding method, the CI is divided into two separate components, ROI and NROI. In order to decorate the safety of the text watermark, RSA encryption techniques is applied to the textual content watermark earlier than embedding and

Secret sharing is a scheme that permits a secret message to be shared among a set P of n participants. The secret is shared in such a way that only qualified subsets of P can recover the secret, any nonqualified subset has no information on the secret. We take into consideration, the problem of encrypting pictures and printed texts such that it is perfectly secure without the hassle of using cryptographic computations. In 1979, Shamir [7] and Blakley [8] introduced the concept of a threshold scheme. A (k, n) threshold scheme is a method whereby n pieces of information of a secret key k, called shares are distributed among n participants so that the k cannot be re constructed from the knowledge of fewer than k shares. In 1995 Naor and Shamir [1] proposed a new type of cryptographic scheme, which could encode and decode secret images without any cryptographic computations. The reason this scheme was considered remarkable was that the secret message