Related papers: An analogue of the ElGamal scheme based on the Mar…
Purpose of this paper is to suggest a scheme, which can be realised with today's technology and could be used for entangling a probe to a photon qubit based on polarisation. Using this probe a translucent or a coherent eavesdropping can be…
A key encapsulation mechanism (KEM) that takes as input an arbitrary string, i.e., a tag, is known as tag-KEM, while a scheme that combines signature and encryption is called signcryption. In this paper, we present a code-based signcryption…
The signcryption is a relatively new cryptographic technique that is supposed to fulfill the functionalities of encryption and digital signature in a single logical step. Although several signcryption schemes are proposed over the years,…
A classical analogue of Deutsch and Jozsa's algorithm is given and its implications on quantum computing is discussed
Lattice based encryption schemes and linear code based encryption schemes have received extensive attention in recent years since they have been considered as post-quantum candidate encryption schemes. Though LLL reduction algorithm has…
We bring in here a novel algebraic approach for attacking the McEliece cryptosystem. It consists in introducing a subspace of matrices representing quadratic forms. Those are associated with quadratic relationships for the component-wise…
We describe a family of highly efficient codes for cryptographic purposes and dedicated algorithms for their manipulation. Our proposal is especially tailored for highly constrained platforms, and surpasses certain conventional and…
Enigma machines are devices that perform cryptography using pseudo-random numbers. The original enigma machine code was broken by detecting hidden patterns in these pseudo-random numbers. This paper proposes a model for a quantum optical…
We present an iterative Markov chainMonte Carlo algorithm for computingreference priors and minimax risk forgeneral parametric families. Ourapproach uses MCMC techniques based onthe Blahut-Arimoto algorithm forcomputing channel capacity…
We give an $\alpha(1+\epsilon)$-approximation algorithm for solving covering LPs, assuming the presence of a $(1/\alpha)$-approximation algorithm for a certain optimization problem. Our algorithm is based on a simple modification of the…
Confidentiality and Integrity are two paramount objectives in the evaluation of information and communication technology. In this paper, we propose an arithmetic approach for designing asymmetric key cryptography. Our method is based on the…
This is a summarized follow up of the unconditional security and quadratic time O(n^2) efficiency of ZK111.
In 2013, Tsai et al. cryptanalyzed Yeh et al. scheme and shown that Yeh et al., scheme is vulnerable to various cryptographic attacks and proposed an improved scheme. In this poster we will show that Tsai et al., scheme is also vulnerable…
We propose modifications of known quasigroup based stream ciphers. Systems of orthogonal n-ary groupoids are used.
We give an endorsement for Cornacchia's famous algorithm. Thus we do not claim anything new but an approach which is supposed to be simpler than those of previous works written with the same aim.
In this paper, we first present an explicit expression for the inverse\emph{} of a type of matrices. As special applications, the inverse of some matrices arising from implicit time integration techniques, such as the well-known implicit…
Encryption schemes often derive their power from the properties of the underlying algebra on the symbols used. Inspired by group theoretic tools, we use the centralizer of a subgroup of operations to present a private-key quantum…
We present a new reduced-order computational method for the molecular dynamics simulation of entangled polymer systems. The polymer chains are modeled as continuous Gaussian chains. Our algorithm is based on the application of the molecular…
We introduce a new probabilistic public-key cryptosystem which combines the main ingredients of the well-known RSA and Rabin cryptosystems. We investigate the security and performance of our new scheme in comparison to the other two.
A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.