Explore chapters and articles related to this topic
Network Reliability and Security
Published in Partha Pratim Sahu, Advances in Optical Networks and Components, 2020
Any encryption system should secure the plaintext against a chosen-plaintext attack. If it is possible, then it must secure against a known-plaintext attack. Failing this, it should secure also at least to immune to a ciphertext-only attack. The ciphers become either secret or public [24]. In a conventional (secret) cipher, the same key is used to encrypt and decrypt a message. Such a key must obviously remain secret. For a public key cipher (which is also known as an asymmetric or a two-key cryptosystem), different keys are used to encrypt and decrypt a message [25]. These keys have a pair of transformations, each of which is the inverse of the other and neither of which is derivable from the other. The encryption key is made publicly known, whereas the corresponding decryption key remains secret.
Probability
Published in William M. Mendenhall, Terry L. Sincich, Statistics for Engineering and the Sciences, 2016
William M. Mendenhall, Terry L. Sincich
Encryption systems with erroneous ciphertexts. In cryptography, ciphertext is encrypted or encoded text that is unreadable by a human or computer without the proper algorithm to decrypt it into plaintext. The impact of erroneous ciphertexts on the performance of an encryption system was investigated in IEEE Transactions on Information Forensics and Security (April, 2013). For one data encryption system, the probability of receiving an erroneous ciphertext is assumed to be β, where 0 < β < 1. The researchers showed that if an erroneous ciphertext occurs, the probability of an error in restoring plaintext using the decryption system is .5. When no error occurs in the received ciphertext, the probability of an error in restoring plaintext using the decryption system is αβ, where 0 < α < 1. Use this information to give an expression for the probability of an error in restoring plaintext using the decryption system.
Data Encryption for IoT Applications Based on Two-Parameter Fuss–Catalan Numbers
Published in Sudhir Kumar Sharma, Bharat Bhushan, Bhuvan Unhelkar, Security and Trust Issues in Internet of Things, 2020
Modern cryptography is based primarily on the application of mathematical systems that belong to the number theory. The efficient generation of a parameter that generates the key is the basic precondition for developing public-key cryptosystems. Cryptography as the science of designing cryptosystems would be too limited if the algorithm would be initialized with only one parameter. Due to this, different cryptosystems use different initialization parameters to implement all the functionality of the selected cipher. Cryptography is a rapidly evolving science, and new ways of encrypting and hiding information are generated on a daily basis. Encryption protects data from unauthorized access or a potential attacker using an algorithm and a key to transform a plaintext into an encrypted text. For this coding system to provide perfect secrecy, it is necessary to fully meet certain conditions. We start from the assumption that the algorithm is secure only if the encryption procedure uses a secret key that has an extremely large space keyspace. In this case, our first task is to generate a random binary sequence that satisfies Catalan key properties. It is important to note that by increasing the Catalan basis of a generated key, we noticed the drastic increase of the keyspace, and thus reducing the possibility of breaking the cipher for an adversary. The secrecy in computer-based cryptosystems is based on the assumption that the opponent does not have enough time to compute. Theoretically, practical cryptosystems can be broken fully or partially, but most commonly such attacks are unattainable due to the time needed to perform such attacks.
Homomorphism on bipolar-valued fuzzy sub-bigroup of a bigroup for secured data transmission over WSN
Published in Automatika, 2023
The objectives of this research are as follows: The extracted shared secret data is extracted once the encryption and decryption processes have been completed in the proposed system.With the help of the encryption technique known as homomorphic encryption, you can add and multiply cipher texts in order to get this output which match an outcome of similar one.Encoding messages or information so that only authorized parties can read it is known as encryption in cryptography.A message or piece of information, known as plaintext in an encryption scheme, is encrypted using an encryption algorithm to create cipher text that can only be decoded and read.An encryption technique typically employs a pseudo-random encryption key produced by an algorithm for technical reasons.
Reversible Data Hiding in Encrypted Images Based on Hybrid Cryptosystem
Published in IETE Technical Review, 2021
This section provides a brief introduction to the main roles and basic steps of RDH-EI methods. In the RDH-EI methods, there are three entities, content owner, data hider, and receiver, as shown in Figure 1. The original image is encrypted with the encryption key and then released in an open environment by content owner. Here, there are several options for the encryption algorithm, it can be chosen as needed. Data hider, who doesn’t own the encryption key in general, is unable to access the ciphertext, i.e. encrypted image. With the data hiding key, data hider can embed some secret message into ciphertext and release the marked encrypted image. In the decoding phase, the receiver has different permissions on the marked encrypted image depending on the keys it holds. If the receiver only owns the encryption key, the decrypted image, which is similar to the original image, can be recovered. But the embedded message cannot be extracted. If the receiver only owns the data hiding key, the secret message can be extracted from a marked encrypted image, and the marked encrypted image can be obtained. The plaintext cannot be recovered without an encryption key. If the receiver has full permissions and owns both the encryption key and the data hiding key, the original image can be perfectly recovered, and the embedded message can be extracted accurately. At present, most of the existing RDH-EI methods follow this basic idea and are constructed based on this framework, as shown in Figure 1.
Reducing the Required Time and Power for Data Encryption and Decryption Using K-NN Machine Learning
Published in IETE Journal of Research, 2018
Mohammad Ubaidullah Bokhari, Qahtan Makki Shallal, Yahya Kord Tamandani
While the technology of cloud computing is providing the services to clients via Internet, both the provider and the user must encrypt the data in order to ensure the security concerns. Data leakage and loss may occur during the network transmission between user and provider. At present, the providers of cloud computing have begun to enhance this aspect. Users must do the encryption by themselves or by third parties to protect their data sufficiently [3]. The technology of encryption contains two prime elements, which are secret key and algorithms. Secret key is an algorithm which will be used basically for decoding and encoding as well, the algorithm is used specially to convert the original data which is a plaintext into cipher text [5]. The Cryptosystem can be divided into two ciphers which are symmetric and asymmetric. Symmetric encryption uses same key to encrypt the plaintext and decrypt the produced cipher-text. Data encryption standard (DES) algorithm and advanced encryption standard (AES) are sufficient examples of symmetric encryption. Asymmetric encryption uses two different keys, one of them is public key which is used to encrypt the plaintext and the other is private key which uses to decrypt the cipher-text. Rivest–Shamir–Adleman (RSA) algorithm and Diffie–Hellman are sufficient examples of asymmetric encryption. There are many advantages attached to AES algorithm such as users can use it freely, stronger than 3DES, fast processing speed, also it fits to use with limited environment of CPU and memory and so on. In RSA algorithm, the secret key management is so easy and it does not require to confidentially assign a secret key [6]. In this paper, we considered the advantages of both encryption algorithms to produce a robust hybrid technique.