Evaluating Deep Learning Techniques for Known-Plaintext Attacks on the Complete Columnar Transposition Cipher [PDF]
This paper examines whether deep neural networks (DNN) can learn knownplaintext attacks on plaintext-ciphertextpairs, that were created by encrypting with complete columnar transposition.
Mikhalev, Vasily +5 more
core +2 more sources
Analysis of Four Historical Ciphers Against Known Plaintext Frequency Statistical Attack [PDF]
The need of keeping information securely began thousands of years. The practice to keep the information securely is by scrambling the message into unreadable form namely ciphertext. This process is called encryption.
Samylingam, Vivegan AL +6 more
core +4 more sources
Cryptanalysis of optical security systems with significant output images [PDF]
The security of the encryption and verification techniques with significant output images is examined by a known-plaintext attack. We introduce an iterative phase-retrieval algorithm based on multiple intensity measurements to heuristically estimate the ...
Guohai Situ +7 more
core +1 more source
Guessing probability under unlimited known-plaintext attack on secret keys for Y00 quantum stream cipher by quantum multiple hypotheses testing [PDF]
. Although quantum key distribution is regarded as promising secure communication, security of Y00 protocol proposed by Yuen in 2000 for the affinity to conventional optical communication is not well-understood yet; its security has been evaluated only ...
T. Iwakoshi
semanticscholar +1 more source
Investigating Deep Learning Approaches on the Security Analysis of Cryptographic Algorithms
This paper studies the use of deep learning (DL) models under a known-plaintext scenario. The goal of the models is to predict the secret key of a cipher using DL techniques.
Bang Yuan Chong, Iftekhar Salam
doaj +1 more source
Known plaintext attack on the binary symmetric wiretap channel [PDF]
The coset encoding scheme for the wiretap channel depends primarily on generating a random sequence of bits for every code block. The secret message indexes into the set of cosets, and a random vector selects the actual code word to be transmitted from that coset.
Rajaraman Vaidyanathaswami +1 more
openaire +1 more source
From Known-Plaintext Security to Chosen-Plaintext Security
We present a new encryption mode for block ciphers. The mode is efficient and is secure against chosen-plaintext attack (CPA) already if the underlying symmetric cipher is secure against known-plaintext attack (KPA). We prove that known (and widely used) encryption modes as CBC mode and counter mode do not have this property.
Damgård, I.B., Nielsen, J.B.
openaire +3 more sources
A known plaintext attack on the PKZIP stream cipher [PDF]
The PKZIP program is one of the more widely used archive/ compression programs on personal computers. It also has many compatible variants on other computers, and is used by most BBS's and ftp sites to compress their archives. PKZIP provides a stream cipher which allows users to scramble files with variable length keys (passwords).
Eli Biham, Paul C. Kocher
openaire +1 more source
Attack and Improvement on a Symmetric Fully Homomorphic Encryption Scheme
Fully homomorphic encryption (FHE) has been regarded as the holy grail of cryptography and supports meaningful computations on encrypted data. Recently, Kumer et al. proposed a symmetric FHE scheme based on the Euler theorem.
Wenju Xu +4 more
doaj +1 more source
Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security [PDF]
Given any weak pseudorandom function, we present a general and efficient technique transforming such a function to a new weak pseudorandom function with an arbitrary length output. This implies, among other things, an encryption mode for block ciphers.
Ivan Damgård, Jesper Buus Nielsen
openaire +1 more source

