Adama Diene
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
Research Subjects
Research Interests
Adama Diene has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Bilal Ahmad Rather
Centre for Research Impact & Outcome, Chitkara University Institute of Engineering and Technology, Chitkara University, Rajpura, India
1 shared publication - Mohamed A. Salim
Department of Mathematical Sciences, United Arab Emirates University, P.O. Box 17551, Al Ain, Abu Dhabi 17551, UAE
1 shared publication - Mohamed El Bachraoui
Department of Mathematical Sciences, United Arab Emirates University, P. O. Box 15551, Al Ain, UAE
1 shared publication - Muhammad Imran
Department of Chemistry, Faculty of Science King Khalid University Abha Saudi Arabia
1 shared publication - Roman Popovych
Lviv Polytechnic National University, 12 Bandera str., 79013, Lviv, Ukraine
1 shared publication - Victor Bovdi
United Arab Emirates University, Al Ain, United Arab Emirates
1 shared publication
Latest Publications
- 3 January 2024
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 57 (2) , 279-292
On spectral spread and trace norm of Sombor matrix
- 3 January 2024
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 57 (2) , 279-292
On spectral spread and trace norm of Sombor matrix
- Open Access
- 1 January 2022
- Published by Vasyl Stefanyk Carpathian National University in Carpathian Mathematical Publications
- Vol. 14 (1) , 238-246
Elements of high order in finite fields specified by binomials
Let F-q be a field with q elements, where q is a power of a prime number p >= 5. For any integer m >= 2 and a is an element of F(q)(*)such that the polynomial x(m) - a is irreducible in F-q[x], we combine two different methods to explicitly construct elements of high order in the field F-q[x]/ < x(m) - a >. Namely, we find elements with multiplicative order of at least 5(3 root m/2), which is better than previously obtained bound for such family of extension fields.
- 1 January 2022
- Published by Vasyl Stefanyk Carpathian National University in Carpathian Mathematical Publications
- Vol. 14 (1) , 238-246
Open AccessElements of high order in finite fields specified by binomials
Let F-q be a field with q elements, where q is a power of a prime number p >= 5. For any integer m >= 2 and a is an element of F(q)(*)such that the polynomial x(m) - a is irreducible in F-q[x], we combine two different methods to explicitly construct elements of high order in the field F-q[x]/ < x(m) - a >. Namely, we find elements with multiplicative order of at least 5(3 root m/2), which is better than previously obtained bound for such family of extension fields.
- Open Access
- 9 July 2019
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2019, 1-7
Evaluation of Some Sums of Polynomials inWe prove the polynomial analogues of some Liouville identities from elementary number theory. Consequently several sums defined over the finite fields are evaluated by combining the results obtained and some of the results from sums of reciprocals of polynomials over .- 9 July 2019
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2019, 1-7
Open AccessEvaluation of Some Sums of Polynomials inWe prove the polynomial analogues of some Liouville identities from elementary number theory. Consequently several sums defined over the finite fields are evaluated by combining the results obtained and some of the results from sums of reciprocals of polynomials over . - Open Access
- 14 March 2018
- Published by Center for Open Science in OSF Preprints
TOTAL EMBEDDED SURFACE ATTACK ON MPKCS FROM DIOPHANTINE EQUATIONS
In 2011, Gao and Heindl presented a new multivariate public key cryptosystems from Diophantine equations. However, by observing the decryption process, Ding et al. found recently that some special embedded surfaces could be used to decrypt the message efficiently. They showed that the three systems proposed by Gao and Heindl could be broken at the complexity of 252,261 and 252 respectively. But, the attack by Ding et al. can not implemented on a usual PC. It was mainly theoretical and worked only for finite fields of characteristic 2. In this paper, We present a practical attack on this family of multivariate public key cryptosystems. Our attack is implemented on a PC and it works for all finite fields. By doing computer experiments, we find many new lower-degree embedded surfaces which help us to break the cryptosystem.
- 14 March 2018
- Published by Center for Open Science in OSF Preprints
Open AccessTOTAL EMBEDDED SURFACE ATTACK ON MPKCS FROM DIOPHANTINE EQUATIONS
In 2011, Gao and Heindl presented a new multivariate public key cryptosystems from Diophantine equations. However, by observing the decryption process, Ding et al. found recently that some special embedded surfaces could be used to decrypt the message efficiently. They showed that the three systems proposed by Gao and Heindl could be broken at the complexity of 252,261 and 252 respectively. But, the attack by Ding et al. can not implemented on a usual PC. It was mainly theoretical and worked only for finite fields of characteristic 2. In this paper, We present a practical attack on this family of multivariate public key cryptosystems. Our attack is implemented on a PC and it works for all finite fields. By doing computer experiments, we find many new lower-degree embedded surfaces which help us to break the cryptosystem.
- Open Access
- 8 April 2013
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2013, 1-7
Fixed Points of the Dickson Polynomials of the Second Kind
The permutation behavior of Dickson polynomials of the first kind has been extensively studied, while such behavior for Dickson polynomials of the second kind is less known. Necessary and sufficient conditions for a polynomial of the second kind to be a permutation over some finite fields have been established by Cohen, Matthew, and Henderson. We introduce a new way to define these polynomials and determine the number of their fixed points.
- 8 April 2013
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2013, 1-7
Open AccessFixed Points of the Dickson Polynomials of the Second Kind
The permutation behavior of Dickson polynomials of the first kind has been extensively studied, while such behavior for Dickson polynomials of the second kind is less known. Necessary and sufficient conditions for a polynomial of the second kind to be a permutation over some finite fields have been established by Cohen, Matthew, and Henderson. We introduce a new way to define these polynomials and determine the number of their fixed points.
- Open Access
On arithmetic sums involving divisor functions in two variables
We prove the analogue of an identity of Huard, Ou, Spearman and Williams and apply it to evaluate a variety of sums involving divisor functions in two variables. It turns out that these sums count representations of positive integers involving radicals.
Open AccessOn arithmetic sums involving divisor functions in two variables
We prove the analogue of an identity of Huard, Ou, Spearman and Williams and apply it to evaluate a variety of sums involving divisor functions in two variables. It turns out that these sums count representations of positive integers involving radicals.