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

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.

Keywords

• elliptic-curve cryptography
• double authentication
• data mining