Related papers: An analogue of the ElGamal scheme based on the Mar…
We present a new attack against cryptosystems based on the rank metric. Our attack allows us to cryptanalyze two variants of the GPT cryptosystem which were designed to resist the attack of Overbeck.
Comparison results for Markov processes w.r.t. function class induced (integral) stochastic orders have a long history. The most general results so far for this problem have been obtained based on the theory of evolution systems on Banach…
We give a new procedure in Maple for finding the k-th power of a martix. The algorithm is based on the article [1].
We propose a cipher similar to the One Time Pad and McEliece cipher based on a subband coding scheme. The encoding process is an approximation to the One Time Pad encryption scheme. We present results of numerical experiments which suggest…
In a recent paper, [Phys. Rev. A 65, 052326 (2002)], Mihara presented several cryptographic protocols that were claimed to be quantum mechanical in nature. In this comment it is pointed out that these protocols can be described in purely…
The paper reports on computation of verified enclosures for the Titchmarsh-Weyl m-function. It examines some cases in which Lohner's AWA algorithm must be suplimented by mathematical analysis.
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. Several signcryption schemes are proposed throughout the years, each…
Krouk, Tavernier and Kabatiansky proposed new variants of the McEliece cryptosystem. In this letter, it is shown that cryptosystem based on correction of errors erasures is equal to the Mc-Eliece cryptosystem with worse parametrs public…
Motivated by the problem of simultaneously preserving confidentiality and usability of data outsourced to third-party clouds, we present two different database encryption schemes that largely hide data but reveal enough information to…
The possibility of simulating a stochastic process by the intrinsic randomness of quantum system is investigated. Two simulations of Markov Chains by the measurements of quantum systems are proposed.
By combining the one-way coupled chaotic map lattice system with a bit-reverse operation, we construct a new cryptosystem which is extremely sensitive to the system parameters even for low-dimensional systems. The security of this new…
Cryptanalysis of knapsack cipher is a fascinating problem which has eluded the computing fraternity for decades. However, in most of the cases either the time complexity of the proposed algorithm is colossal or an insufficient number of…
Recently, an image encryption algorithm using block-based scrambling and image filtering has been proposed by Hua et al. In this paper, we analyze the security problems of the encryption algorithm in detail and break the encryption by a…
When are two algorithms the same? How can we be sure a recently proposed algorithm is novel, and not a minor variation on an existing method? In this paper, we present a framework for reasoning about equivalence between a broad class of…
The Skorokhod reflection of a continuous semimartingale is unfolded, in a possibly skewed manner, into another continuous semimartingale on an enlarged probability space according to the excursion-theoretic methodology of Prokaj (2009).…
An iterative method is derived for image reconstruction. Among other attributes, this method allows constraints unrelated to the radiation measurements to be incorporated into the reconstructed image. A comparison is made with the widely…
We prove a computable version of Hall's Harem Theorem and apply it to computable versions of Tarski's alternative theorem.
This survey provides a comparative overview of code-based signature schemes with respect to security and performance. Furthermore, we explicitly describe serveral code-based signature schemes with additional properties such as…
We consider numerical approximations of stochastic Langevin equations by implicit methods. We show a weak backward error analysis result in the sense that the generator associated with the numerical solution coincides with the solution of a…
We offer a digital signature scheme using Boolean automorphisms of a multivariate polynomial algebra over integers. Verification part of this scheme is based on the approximation of the number of zeros of a multivariate Boolean function.