Omar Khadir
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Omar Khadir has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- László Németh
University of Sopron
3 shared publications - László Szalay
Department of Mathematics, J. Selye University, Komarno, Slovakia
3 shared publications - Omar Akchiche
Fstm, University Hassan II of Casablanca
2 shared publications - J. Ettanfouhi
Laboratory of Mathematics, Cryptography and Mechanics Fstm, University Hassan II of Casablanca Morocco
1 shared publication - Leila Zahhafi
Laboratory of Mathematics, Cryptography, Mechanics and Numerical Analysis, Faculty of Sciences and Techniques, University Hassan II of Casablanca, 20650 Mohammedia, Morocco
1 shared publication - László Szalay
Institute of Mathematics and Statistics University of West Hungary , H-9400 Sopron, Erzsébet utca 9 , Hungary
1 shared publication
Latest Publications
- Open Access
- 26 September 2024
- Published by Springer Nature in Results in Mathematics
- Vol. 79 (7) , 1-13
Tiling of dominoes with ranked colors
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.- 26 September 2024
- Published by Springer Nature in Results in Mathematics
- Vol. 79 (7) , 1-13
Open AccessTiling of dominoes with ranked colors
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. - 12 October 2020
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 25 (6) , 1705-1716
A DSA-like digital signature protocol
In this paper we propose a new digital signature protocol inspired by the DSA algorithm. The security and the complexity are analyzed. Our method constitutes an alternative if the classical scheme DSA is broken.
- 12 October 2020
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 25 (6) , 1705-1716
A DSA-like digital signature protocol
In this paper we propose a new digital signature protocol inspired by the DSA algorithm. The security and the complexity are analyzed. Our method constitutes an alternative if the classical scheme DSA is broken.
- 3 July 2018
- Published by Taylor & Francis in International Journal of Computer Mathematics: Computer Systems Theory
- Vol. 3 (3) , 196-203
Factoring RSA moduli when a message is close to a multiple of the primes
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.
- 3 July 2018
- Published by Taylor & Francis in International Journal of Computer Mathematics: Computer Systems Theory
- Vol. 3 (3) , 196-203
Factoring RSA moduli when a message is close to a multiple of the primes
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.
- Open AccessOn sunlet graphs connected to a specific map on $\{1,2,\dots,p-1\}$In this article, we study the structure of the graph implied by a given map on the set $S_p=\{1,2,\dots,p-1\}$, where $p$ is an odd prime. The consecutive applications of the map generate an integer sequence, or in graph theoretical context a walk, that is linked to the discrete logarithm problem.Open AccessOn sunlet graphs connected to a specific map on $\{1,2,\dots,p-1\}$In this article, we study the structure of the graph implied by a given map on the set $S_p=\{1,2,\dots,p-1\}$, where $p$ is an odd prime. The consecutive applications of the map generate an integer sequence, or in graph theoretical context a walk, that is linked to the discrete logarithm problem.
- 1 June 2018
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 29 (3) , 245-259
Factoring RSA moduli with primes sharing bits in the middle
- 1 June 2018
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 29 (3) , 245-259
Factoring RSA moduli with primes sharing bits in the middle
- 1 January 2018
- Published by Annales Mathematicae et Informaticae - AMI in Annales Mathematicae et Informaticae
- Vol. 49, 101-107
On sunlet graphs connected to a specific map on {1, 2, . . . , p − 1}
- 1 January 2018
- Published by Annales Mathematicae et Informaticae - AMI in Annales Mathematicae et Informaticae
- Vol. 49, 101-107
On sunlet graphs connected to a specific map on {1, 2, . . . , p − 1}
- Open Access
- 8 September 2016
- Published by MECS Publisher in International Journal of Computer Network and Information Security
- Vol. 8 (9) , 27-33
Alternative Equations for Guillou-Quisquater Signature Scheme
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.
- 8 September 2016
- Published by MECS Publisher in International Journal of Computer Network and Information Security
- Vol. 8 (9) , 27-33
Open AccessAlternative Equations for Guillou-Quisquater Signature Scheme
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 January 2016
- Published by Walter de Gruyter GmbH in Groups - Complexity - Cryptology
- Vol. 8 (1) , 47-54
Factoring multi-power RSA moduli with primes sharing least or most significant bits
We study the factorization of a balanced multi-power RSA moduli N = prq when the unknown primes p and q share t least or most significant bits. We show that if t ≥ 1/(1+r)log p, then it is possible to compute the prime decomposition of N in polynomial time in log N. This result can be used to mount attacks against several cryptographic protocols that are based on the moduli N.
- 1 January 2016
- Published by Walter de Gruyter GmbH in Groups - Complexity - Cryptology
- Vol. 8 (1) , 47-54
Factoring multi-power RSA moduli with primes sharing least or most significant bits
We study the factorization of a balanced multi-power RSA moduli N = prq when the unknown primes p and q share t least or most significant bits. We show that if t ≥ 1/(1+r)log p, then it is possible to compute the prime decomposition of N in polynomial time in log N. This result can be used to mount attacks against several cryptographic protocols that are based on the moduli N.
- Open Access
- 1 December 2015
- Published by Springer Nature in Acta Universitatis Sapientiae, Informatica
- Vol. 7 (2) , 143-150
Factoring multi power RSA moduli with a class of secret exponents
In this paper, we consider the RSA variant based on the key equation ed ≡ 1 (mod φ(N)) where N = prq, r ≥ 2. We show that if the secret exponent d is close to any multiple of the prime factor p or its powers, then it is possible to factor N in polynomial time in log N.
- 1 December 2015
- Published by Springer Nature in Acta Universitatis Sapientiae, Informatica
- Vol. 7 (2) , 143-150
Open AccessFactoring multi power RSA moduli with a class of secret exponents
In this paper, we consider the RSA variant based on the key equation ed ≡ 1 (mod φ(N)) where N = prq, r ≥ 2. We show that if the secret exponent d is close to any multiple of the prime factor p or its powers, then it is possible to factor N in polynomial time in log N.
- Open Access
Insecure primitive elements in an ElGamal signature protocol
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.Open AccessInsecure primitive elements in an ElGamal signature protocol
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.