In 1990, Guillou and Quisquater published an article where they described a new digital signature system. Their technique was based on the RSA algorithm. In this paper, we present several modified Guillou-Quisquater digital signature protocols. We discuss their security and complexity. These schemes can be seen as alternative signature methods if existing systems are completely broken.
1 February 2010 in Journal of Interdisciplinary Mathematics
We describe, in this paper, new sufficient conditions for factoring a particular class of large integers. The method can be used to construct attacks against the RSA or Rabin cryptosystem.
Several articles deal with tilings with various colors and shapes. In this paper, we present a new type of tiling problem of a $$(1\times n)$$ —board where the colors have a prescribed order of preference and the size of colored dominoes is bounded by $$(1\times s)$$ . We show that the total number of tilings can be given as a linearly recurrent sequence of order ks, and at the same time by a higher order self-convolution of s-generalized Fibonacci sequences.
3 July 2018 in International Journal of Computer Mathematics: Computer Systems Theory
Let N=pq be an RSA modulus. Assume that we are given the ciphertext of a message that is close to a multiple of the divisors of N. We show that it is possible to factor N in polynomial time in when a low public exponent is used. The idea is generalized to some RSA variants and Rabin system.
Consider the classical ElGamal digital signature scheme based on the modular relation $\alpha^m\equiv y^r\, r^s\ [p]$. In this work, we prove that if we can compute a natural integer $i$ such that $\alpha^i\ mod\ p$ is smooth and divides $p-1$, then it is possible to sign any given document without knowing the secret key. Therefore we extend and reinforce Bleichenbacher's attack presented at Eurocrypt'96.