IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2022i1p122-d1016592.html
   My bibliography  Save this article

Optimal Elliptic-Curve Subspaces for Applications in Double-Authenticated Requests in Mobile Distributed Data Mining

Author

Listed:
  • Daniel Ioan Hunyadi

    (Faculty of Science, Department of Mathematics and Informatics, Lucian Blaga University of Sibiu, 550012 Sibiu, Romania
    These authors contributed equally to this work.)

  • Oana-Adriana Ticleanu

    (Faculty of Science, Department of Mathematics and Informatics, Lucian Blaga University of Sibiu, 550012 Sibiu, Romania
    These authors contributed equally to this work.)

  • Nicolae Constantinescu

    (Faculty of Science, Department of Mathematics and Informatics, Lucian Blaga University of Sibiu, 550012 Sibiu, Romania
    These authors contributed equally to this work.)

Abstract

Mathematical models based on elliptic curves have been intensively studied since their applicability in data security systems was discovered. In this article, the authors describe the optimal way to select particular subspaces over which elliptic curves are defined, showing the applicability of these subspaces in secure data transfer. Access to large databases and analyses of the requests made to these databases are required daily by a variety of users, including legal entities. An attack on these communication systems causes violations in privacy and damage to/theft of data that can be worth EUR tens of billions annually. For requests made between computers, encryption methods can be used as these systems have adequate computing power and energy. For requests made from fixed and mobile systems, if the data are distributed heterogeneously, the computing power required to authenticate both the users and the answering entities determines the efficiency of the proposed solution. To address this limitation, our study proposes a double-authentication method based on particular elliptic-curve systems.

Suggested Citation

  • Daniel Ioan Hunyadi & Oana-Adriana Ticleanu & Nicolae Constantinescu, 2022. "Optimal Elliptic-Curve Subspaces for Applications in Double-Authenticated Requests in Mobile Distributed Data Mining," Mathematics, MDPI, vol. 11(1), pages 1-14, December.
    • Handle: RePEc:gam:jmathe:v:11:y:2022:i:1:p:122-:d:1016592
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/1/122/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/1/122/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ana Maria Acu & Alexandra Măduţa & Diana Otrocol & Ioan Raşa, 2020. "Inequalities for Information Potentials and Entropies," Mathematics, MDPI, vol. 8(11), pages 1-18, November.
    2. Ana Maria Acu & Sever Hodiş & Ioan Rașa, 2020. "Estimates for the Differences of Certain Positive Linear Operators," Mathematics, MDPI, vol. 8(5), pages 1-12, May.
    3. Rania Baashirah & Abdelshakour Abuzneid & Salah Addine Mellouki & Zeba Siraj & Cheng Zhan, 2021. "Low-Cost RFID Authentication Protocol Based on Elliptic Curve Algorithm," International Journal of Interdisciplinary Telecommunications and Networking (IJITN), IGI Global, vol. 13(2), pages 1-11, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ana Maria Acu & Ioan Raşa & Hari M. Srivastava, 2023. "Some Functionals and Approximation Operators Associated with a Family of Discrete Probability Distributions," Mathematics, MDPI, vol. 11(4), pages 1-9, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2022:i:1:p:122-:d:1016592. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.