Optimal Elliptic-Curve Subspaces for Applications in Double-Authenticated Requests in Mobile Distributed Data Mining
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 thes...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-12-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/11/1/122 |
| _version_ | 1797406798126252032 |
|---|---|
| author | Daniel Ioan Hunyadi Oana-Adriana Ticleanu Nicolae Constantinescu |
| author_facet | Daniel Ioan Hunyadi Oana-Adriana Ticleanu Nicolae Constantinescu |
| author_sort | Daniel Ioan Hunyadi |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-03-09T03:31:49Z |
| format | Article |
| id | doaj.art-c5992dc844374119b7aae9bd536de05c |
| institution | Directory Open Access Journal |
| issn | 2227-7390 |
| language | English |
| last_indexed | 2024-03-09T03:31:49Z |
| publishDate | 2022-12-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Mathematics |
| spelling | doaj.art-c5992dc844374119b7aae9bd536de05c2023-12-03T14:54:44ZengMDPI AGMathematics2227-73902022-12-0111112210.3390/math11010122Optimal Elliptic-Curve Subspaces for Applications in Double-Authenticated Requests in Mobile Distributed Data MiningDaniel Ioan Hunyadi0Oana-Adriana Ticleanu1Nicolae Constantinescu2Faculty of Science, Department of Mathematics and Informatics, Lucian Blaga University of Sibiu, 550012 Sibiu, RomaniaFaculty of Science, Department of Mathematics and Informatics, Lucian Blaga University of Sibiu, 550012 Sibiu, RomaniaFaculty of Science, Department of Mathematics and Informatics, Lucian Blaga University of Sibiu, 550012 Sibiu, RomaniaMathematical 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.https://www.mdpi.com/2227-7390/11/1/122elliptic-curve cryptographydouble authenticationdata mining |
| spellingShingle | Daniel Ioan Hunyadi Oana-Adriana Ticleanu Nicolae Constantinescu Optimal Elliptic-Curve Subspaces for Applications in Double-Authenticated Requests in Mobile Distributed Data Mining Mathematics elliptic-curve cryptography double authentication data mining |
| title | Optimal Elliptic-Curve Subspaces for Applications in Double-Authenticated Requests in Mobile Distributed Data Mining |
| title_full | Optimal Elliptic-Curve Subspaces for Applications in Double-Authenticated Requests in Mobile Distributed Data Mining |
| title_fullStr | Optimal Elliptic-Curve Subspaces for Applications in Double-Authenticated Requests in Mobile Distributed Data Mining |
| title_full_unstemmed | Optimal Elliptic-Curve Subspaces for Applications in Double-Authenticated Requests in Mobile Distributed Data Mining |
| title_short | Optimal Elliptic-Curve Subspaces for Applications in Double-Authenticated Requests in Mobile Distributed Data Mining |
| title_sort | optimal elliptic curve subspaces for applications in double authenticated requests in mobile distributed data mining |
| topic | elliptic-curve cryptography double authentication data mining |
| url | https://www.mdpi.com/2227-7390/11/1/122 |
| work_keys_str_mv | AT danielioanhunyadi optimalellipticcurvesubspacesforapplicationsindoubleauthenticatedrequestsinmobiledistributeddatamining AT oanaadrianaticleanu optimalellipticcurvesubspacesforapplicationsindoubleauthenticatedrequestsinmobiledistributeddatamining AT nicolaeconstantinescu optimalellipticcurvesubspacesforapplicationsindoubleauthenticatedrequestsinmobiledistributeddatamining |