The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Cryptography is a technique by which the stored and transferred data in a particular form can be comprehended and processed by only those, who it is intended for. In the modern era, cryptography is most often associated with the deception of the plaintext into a cipher text using a process called Encryption then back to the original plaintext using a process called Decryption. Strong cryptography...
The Closest Vector Problem (CVP) and the Shortest Vector Problem (SVP) are prime problems in lattice-based cryptanalysis, since they underpin the security of many lattice-based cryptosystems. Despite the importance of these problems, there are only a few CVP-solvers publicly available, and their scalability was never studied. This paper presents a scalable implementation of an enumeration-based CVP-solver...
The Closest Vector Problem (CVP) and the Shortest Vector Problem (SVP) are prime problems in lattice-based cryptanalysis, since they underpin the security of many lattice-based cryptosystems. Despite the importance of these problems, there are only a few CVP-solvers publicly available, and their scalability was never studied. This paper presents a scalable implementation of an enumeration-based CVP-solver...
This paper presents two layered security for data hiding by combining steganography and visual cryptography (VC). Classically, VC encrypts a secret image into noise like images called as shares and decrypts secret message by stacking of shares, whereas steganography hides secret into another image called as cover image, where only intended receiver decodes the message. Steganography often encodes...
In this paper, a new method of image steganography in spatial domain on gray images blend with cryptography is present. Steganography and cryptography are used to hide message and its meaning respectively. By this method, the message is first encrypted using Vernam cipher algorithm and then the message (encrypted) is embedded inside an image using the new image steganography method i.e. LSB with Shifting...
The process of jumbling up the contents of a secret message so as to secure it, is known as cryptography, whereas the process of hiding the very existence of a secret message is known as steganography. The term “steganography” describes the method by which the contents of a secret message are concealed inside some other medium, so as to avoid any kind of detection by an intruder. In this paper, we...
In this paper, we analyze security of McEliece cryptosystem based on Low Density Parity Check (LDPC) and Moderate (MDPC) codes, as well as the complexity of the corresponding cryptosystem. Several approaches are proposed to improve the cryptosystem security for the case when complexity of cryptosystem has to be below the prescribed level. A certain modifications of Gradient Descent Bit Flipping (GDBF)...
Distributed Network Protocol (DNP3) is a set of communications protocols used between components in industrial control systems, especially power electric systems. Those systems should have integrity, low complexity, authentication and so on. Among them, the scheme using cyclic shift operation that can satisfy the integrity and complexity is addressed. Furthermore, another scheme using undetected burst...
In this paper, we present a zero-forcing (ZF) attack on the physical layer cryptography scheme based on massive multiple-input multiple-output (MIMO). The scheme uses singular value decomposition (SVD) precoder. We show that the eavesdropper can decrypt/decode the information data under the same condition as the legitimate receiver. We then study the advantage for decoding by the legitimate user over...
It is well-known that feedback does not increase the capacity of point-to-point memoryless channels, however, the advantage it poses to secure communications is not fully understood yet. In this work, an achievable scheme for the wiretap channel with generalized feedback is presented. This scheme employs the feedback signal to generate a secret key shared between the legitimate users, which is then...
Algebraic Manipulation Detection (AMD) codes form a cryptographic primitive designed to detect data corruption of the form of an additive operation in an Abelian group. In this paper, we discuss the applicability of AMD codes to protect erasure code based storage systems from a Byzantine adversary injecting fake data in the distributed storage system. We study a special class of AMD codes which relies...
In single-level cell flash memory, the most popular error correction code used for protection of the stored data is Bose-Chaudhuri-Hocquenghem (BCH) codes. However, BCH codes are not adequate to meet the error requirements of multi-level cell flash memory. Serial concatenation of codes increases the error correcting capability of the resulting system. Hence, a favorable concatenated coding scheme...
Traditional visual secret sharing (VSS) schemes share secret images in form of shares that may be printed on transparencies or stored in any digital form. The shares used in those methods would be noiselike or meaningful which will increase transmission risk. This effects both the secret and the participants. In order to solve this problems a secret sharing method which uses another images to transmit...
LSB steganography and Vigenere chiper methods are integrated in used for data security validation in this study. This approach used Arithmetic Coding method for data compression and data decompression. To maintain the authenticity of the data file, a hash function (SHA 256) technique was added. This paper presents a prototype called Ste-Chy as a proof of concept of the combination of these techniques...
Protecting data is a critical part of life in the modern world. The science of protecting data, known as cryptography, makes use of secret keys to encrypt data in a format that is not easily decipherable. However, most modern cryptography systems use passwords to perform user authentication. These passwords are a weak link in the security chain, and are a common point of attack on cryptography schemes...
Visual cryptography is a new paradigm to encode a secret image into multiple shares of images. It relies on decoding of image directly through the human eyes by stacking the shares, thus require minimal overhead for reconstruction of image. The secret sharing scheme can be considered as a basis for secure key management. In some situations, it may be possible that key becomes unavailable due to some...
In an erasure adversarial wiretap channel (eAWTP-channel), the adversary can select a fraction ρr of the codeword to read, and a fraction ρe of the codeword to erase. The model can be seen as an extension of the wiretap II model where the adversary not only selects its view of the transmitted word, but also can erase a fraction of the codeword. eAWTP codes provide security and reliability for communication...
Secrets sharing is an interesting topic and has studied for a period of time. This paper proposed a method to deal with the audio secret sharing based on fractal encoding. The proposed method has negligible constraints on secret audio and shared audios. Using fractal encoding makes the size of the secret reduces 40% in this study and the architecture is simple to practice. The fractal codes were divided...
Skew polynomials are elements of a noncommutative ring that, in recent years, have found applications in coding theory and cryptography. Skew polynomials have a well-defined evaluation map. This map leads to the definition of a class of codes called Generalized Skew-Evaluation codes that contains Gabidulin codes as a special case as well as other related codes with additional desirable properties...
The broadcast channel with independent secret keys is studied. In this scenario, a common message has to be securely broadcast to two legitimate receivers in the presence of an eavesdropper. The transmitter shares with each legitimate receiver an independent secret key of arbitrary rate. These keys can either be used as one-time pads to encrypt the common message or can be interpreted as fictitious...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.