Nonlinearities on particular elliptic curves subspaces and applications

Ramzi Alsaedi; Abdelwahab Dhifli; Abdeljabbar Ghanmi

doi:10.2478/auom-2020-0033

.blurhash-client-img { display: none !important; }

Nonlinearities on particular elliptic curves subspaces and applications

Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică

Volume 28 (2020): Issue 3 (December 2020)

By: Ramzi Alsaedi, Abdelwahab Dhifli and Abdeljabbar Ghanmi

Open Access

|Dec 2020

Abstract

Researching on mathematical models for cryptography means to, primary, define the optimal spaces and rules for which we can archive the maximum time to find the involved parameters of the keys and, in the same time, to optimise the time for key generation.

In the present work, we treat a particular case of some subspaces from elliptic curves which respect the announced principles.

References

[1] D. Chaum and E. van Heyst, Group signatures, Advances in Cryptology EUROCRYPT ‘91, Vol. 547 of Lecture Notes in Computer Science, Springer-Verlag, pp. 257–265, 199110.1007/3-540-46416-6_22
Search in Google Scholar Back to article
[2] J. Camenisch and M. Stadler, Efficient group signatures schemes for large groups, Advances in Cryptology-Crypto 1997, Vol. 1294 of Lecture Notes in Computer Science, Springer-Verlag, pp. 410–424, 199710.1007/BFb0052252
Search in Google Scholar Back to article
[3] Oana Ticleanu, Nicolae Constantinescu, Daniel Ebanca, Intelligent data retrieval with hierarchically structured information, KES-IIMS, Vol. 254, pp. 345–351, Jun 26-28, Portugal, 2013
Search in Google Scholar Back to article
[4] Oana Ticleanu, Differential operators over particular elliptic curves spaces with cryptographic applications. E. Journal of Differential Equations, Vol. 2015, No.303, pp. 19, 2015.
Search in Google Scholar Back to article
[5] Oana Ticleanu, Endomorphisms on elliptic curves for optimal subspaces and applications to differential equations and nonlinear cryptography. E. Journal of Differential Equations, Vol 2015, No.214, pp. 19, 2015.
Search in Google Scholar Back to article
[6] Alin Golumbeanu, Oana Ticleanu, Elliptic Curves Differentiation with Application to Group Signature Scheme, E. Journal of Differential Equations, Vol. 2017, No. 237, pp. 121, 2017.
Search in Google Scholar Back to article
[7] Nicolae Constantinescu, Oana Ticleanu, Alin Golumbeanu, Nonlinieari-ties on Cryptographic Shift Registers, Annals of the University of Craiova, Mathematics and Computer Science Series, Vol. 43(1), pp. 2732, 2016.
Search in Google Scholar Back to article
[8] Schoof, R. Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp.1985, 44, 483–494.
Search in Google Scholar Back to article
[9] Nicolae Constantinescu, Authentication ranks with identities based on elliptic curves, Annals of the University of Craiova, Mathematics and Computer Science Series, Vol. XXXIV(1), pp. 94–99, 2007
Search in Google Scholar Back to article
[10] Silisteanu Calina, Mitariu Loredana, Ranga Remus, Antonescu Elisabeta, Duica Lavinia, Racheriu Mihaela, Totan Maria and Manea Marinela, Potentiating the Effect of Treatment with Voltaren Gel Using Ultrasonic Frequencies of 1 MHz, Revista de Chimie, 69 (2018), no. 7, 1749–1751.
Search in Google Scholar Back to article
[11] Ramzi Alsaedi, Nicolae Constantinescu, Vicentiu Radulescu, Nonlinearities in Elliptic Curve Authentication, Entropy, Vol. 16(9), pp. 5144–5158, 201410.3390/e16095144
Search in Google Scholar Back to article
[12] Montgomery, P.L. Modular Multiplication without Trial Division. Math. Comput.1985, 44, 519–521.
Search in Google Scholar Back to article
[13] Nicolae Constantinescu, Security System Vulnerabilities, Proceedings of the Romanian Academy Series A-Mathematics Physics Technical Sciences Information Science, Vol. 13(2), pp. 175–179, 2012
Search in Google Scholar Back to article
[14] Muller, V. Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two. J. Cryptol.1998, 11, 219–234.
Search in Google Scholar Back to article
[15] Duica Lavinia, Antonescu Elisabeta, Pirlog Mihail, Purnichi Traian, Szakacs Julianna, Totan Maria, Vintila Bogdan, Mitariu Mihaela, Mitariu Sebastian, Cernusca and Stetiu Andreea, Clinical and Biochemical Correlations of Aggression in Young Patients with Mental Disorders, Revista de Chimie, 69 (2018), no. 6, 1544–1549.
Search in Google Scholar Back to article
[16] Ion Iancu, Nicolae Constantinescu and Mihaela Colhon, Fingerprints Identification using a Fuzzy Logic System, International Journal of Computers, Communications & Control, Vol. 5(4), pp. 525–531, 201010.15837/ijccc.2010.4.2510
Search in Google Scholar Back to article
[17] Nicolae Constantinescu, George Stephanides, Mirel Cosulschi and Mihai Gabroveanu, RSA-Padding Signatures with Attack Studies, International Conference on Web Information Systems and Technologies: Internet Technology/Web Interface and Applications, Portugal, ISBN 978-972-8865-46-7, pp. 97–100, 2006
Search in Google Scholar Back to article
[18] Mutica M., Ciubara Anamaria, Duica Lavinia, Alexandru D., Plesea Condratovici, Pirlog Mihail and Cara M., Elderly schizophrenic patients -clinical and social correlations, European Neuropsychopharmacology, 26 (2016), no. 2, 5512-5512.
Search in Google Scholar Back to article
[19] Nicolae Constantinescu, Authentication hierarchy based on blind signature, Journal of Knowledge Communication and Computing Technologies, Vol. 1(1), pp. 77–84, 2010.
Search in Google Scholar Back to article
[20] A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography, 5th Ed. CRC Press, 2001
Search in Google Scholar Back to article
[21] D. Yong, G. Feng, High speed modular divider based on GCD algorithm over GF(2m), Journal on Communications, Vol. 29(10), pp. 199–204, oct. 2008
Search in Google Scholar Back to article
[22] Emil Simion and Nicolae Constantinescu, Complexity Computations in Code Cracking Problems, Concurrent Engineering in Electronic Packaging, IEEE Communication, may 05-09, pp. 225–232, ISSE 2001
Search in Google Scholar Back to article
[23] N. Smart, How secure are elliptic curves over composite extension fields?, EUROCRYPT 2001, Vol. 2045 of Lecture Notes in Computer Science, Springer-Verlag, pp. 30–39, 200110.1007/3-540-44987-6_3
Search in Google Scholar Back to article

Articles in this issue

DOI: https://doi.org/10.2478/auom-2020-0033 | Journal eISSN: 1844-0835 | Journal ISSN: 1224-1784

Journal RSS Feed

Language: English

Page range: 39 - 49

Submitted on: Jan 7, 2020

Accepted on: Feb 17, 2020

Published on: Dec 28, 2020

Published by: Ovidius University of Constanta

In partnership with: Paradigm Publishing Services

Publication frequency: 3 issues per year

Keywords:

Related subjects:

© 2020 Ramzi Alsaedi, Abdelwahab Dhifli, Abdeljabbar Ghanmi, published by Ovidius University of Constanta
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Volume 28 (2020): Issue 3 (December 2020)