Related papers: Proof of Correspondence between Keys and Encoding …
Encodings or the proof of their absence are the main way to compare process calculi. To analyse the quality of encodings and to rule out trivial or meaningless encodings, they are augmented with quality criteria. There exists a bunch of…
Making topological authentication from theory to practical application is an important and challenging task. More and more researchers pay attention on coming quantum computation, privacy data protection, lattices and cryptography. Research…
This paper constructs two encryption methods using 2-D chaotic maps, Duffings and Arnold's cat maps respectively. Both of the methods are designed using message embedded scheme and are analyzed for their validity, for plaintext sensitivity,…
We investigate quantum authentication schemes constructed from quantum error-correcting codes. We show that if the code has a property called purity testing, then the resulting authentication scheme guarantees the integrity of ciphertexts,…
Two-dimensional mappings obtained by coupling two piecewise increasing expanding maps are considered. Their dynamics is described when the coupling parameter increases in the expanding domain. By introducing a coding and by analysing an…
Card-based cryptography is a research area to implement cryptographic procedures using a deck of physical cards. In recent years, it has been found to be related to finite group theory and algebraic combinatorics, and is becoming more and…
General cryptographic schemes are presented where keys can be one-time or ephemeral. Processes for key exchange are derived. Public key cryptographic schemes based on the new systems are easily established. Authentication and signature…
Encodings or the proof of their absence are the main way to compare process calculi. To analyse the quality of encodings and to rule out trivial or meaningless encodings, they are augmented with encodability criteria. There exists a bunch…
In recent years, information security essential in various arenas like internet communication, multimedia systems, medical imaging, tele-medicine and military communication. However, most of them faced with some problems such as the lack of…
We consider a setup in which the channel from Alice to Bob is less noisy than the channel from Eve to Bob. We show that there exist encoding and decoding which accomplish error correction and authentication simultaneously; that is, Bob is…
We introduce Cryptis, an extension of the Iris separation logic that can be used to verify cryptographic components using the symbolic model of cryptography. The combination of separation logic and cryptographic reasoning allows us to prove…
This paper analyzes the security of a recent cryptosystem based on the ergodicity property of chaotic maps. It is shown how to obtain the secret key using a chosen-ciphertext attack. Some other design weaknesses are also shown.
If Alice must communicate with Bob over a channel shared with the adversarial Eve, then Bob must be able to validate the authenticity of the message. In particular we consider the model where Alice and Eve share a discrete memoryless…
Recently, an image block encryption algorithm was proposed based on some well-known chaotic maps. The authors claim that the encryption algorithm achieves enough security level and high encryption speed at the same time. In this paper, we…
In this paper, algorithms for multivariate public key cryptography and digital signature are described. Plain messages and encrypted messages are arrays, consisting of elements from a fixed finite ring or field. The encryption and…
We study the homomorphism induced in homology by a closed correspondence between topological spaces, using projections from the graph of the correspondence to its domain and codomain. We provide assumptions under which the homomorphism…
A one-to-one correspondence is proved between the N-rooted ribbon graphs, or maps, with e edges and the (e-N+1)-loop Feynman diagrams of a certain quantum field theory. This result is used to obtain explicit expressions and relations for…
This paper reports a detailed cryptanalysis of a recently proposed encryption scheme based on the logistic map. Some problems are emphasized concerning the key space definition and the implementation of the cryptosystem using floating-point…
This paper presents the first decoding algorithm for Gabidulin codes over Galois rings with provable quadratic complexity. The new method consists of two steps: (1) solving a syndrome-based key equation to obtain the annihilator polynomial…
A new generalization of the Gray map is introduced. The new generalization $\Phi: Z_{2^k}^n \to Z_{2}^{2^{k-1}n}$ is connected with the known generalized Gray map $\phi$ in the following way: if we take two dual linear $Z_{2^k}$-codes and…