China
Africa
Explore chapters and articles related to this topic
Securing Future Autonomous Applications Using Cyber-Physical Systems and the Internet of Things
Published in Amit Kumar Tyagi, Niladhuri Sreenath, Handbook of Research of Internet of Things and Cyber-Physical Systems, 2022
S. Sobana, S. Krishna Prabha, T. Seerangurayar, S. Sudha
Elliptic curve digital signature algorithm (ECDSA) is an alternative of the digital signature algorithm (DSA). It uses the concept of elliptic curve cryptography (ECE) where the bit size of the public key is twice that of the security level. ECC is a type of public key cryptography based on the algebraic structure of elliptic curves over finite fields. ECDSA requires smaller keys than RSA to provide equivalent security and hence more efficient. ECDSA is used for digital signatures, key agreements, and pseudo-random generators. As an example, if the security level is 50 then the public key would be 100 bits and attacker require 2^50 attempts to find out the private key, whereas for DSA the size of the public key is at least 1024 bits. The signature size is about 4 times the security level measured in bits [130].
Biometrics-Based Authentication Scheme for Cloud Environment
Published in S. Ramakrishnan, Cryptographic and Information Security, 2018
Image based identification of a user is the highest level of security that can be provided for any user level access. In recent years cloud and big data are gaining popularity due to their ubiquitous nature. Cloud is a ubiquitous computing technology dependent on geographically distributed computing entities like storage servers, dedicated systems and software. A cloud environment has dedicated systems, servers to provide the service promised by the service providers. As cloud computing is gaining more popularity, more importance is given to security issues such as, authentication, access control, storage, storage security and virtualization. Secure user authentication is one of the main necessities of cloud computing in order to avoid loss for a cloud service provider and to provide secure service to the valid user. A secure biometric based authentication scheme is proposed which provides secure user identification, mutual authentication, session key issue and proxy issue in cases where a single cloud SP provides more than one service. Cryptographic algorithm such as elliptic curve cryptography (ECC) is used for secure key generation and exchange. A new data is added in each round of the message communicated, to include freshness in the biometric based authentication scheme to resist against replay attack. The biometrics-based authentication scheme has optimal communication and computation cost and hence, it can also be utilized for mobile cloud users.
Lightweight Cryptography for Low Cost RFID: A New Direction in Cryptography
Published in Syed Ahson, Mohammad Ilyas, RFID Handbook, 2017
Damith C. Ranasinghe, Raja Ghosal, Alfio Grasso, Peter H. Cole
Elliptic Curve Cryptography (ECC) is a newer approach than RSA with the advantage of smaller key sizes than RSA to achieve the same level of security as the more popular RSA systems. ECC has the hardness of exponential time challenge for cryptanalysts attempting to obtain plaintext from ciphertext with no knowledge of the keys used. As a comparison, in ECC, a 160 bits key provides the same security as a 1024 bits key in RSA, 224 key in ECC provides the same level of security as 2048 bits key in RSA. RSA systems require larger key sizes to achieve a level of computational security considered as being adequate given availability of relatively cheap computing power. ECC implementations require lower memory due to shorter keys and correspondingly lower computations. However, the nature of the ECC algorithm is such that their execution places greater demands on power consumption (Menezes, 1993). There are also no known subexponential time algorithms for successfully attacking elliptic curve cryptosystems (Basubramaniun, 2003).
Protection of COVID-19 images using multiple elliptic curve cryptography
Published in The Imaging Science Journal, 2023
Diana Laishram, N. Tuturaja Singh, Khumanthem Manglem Singh
In 1985, Miller [38] and Koblitz [39] independently introduced elliptic curve cryptography that can achieve same or better performance in efficiency and higher security in comparison with other cryptographic algorithms at low key-size. The difficulty of the discrete logarithm issue for the elliptic curve determines the effectiveness of ECC (ECDLP). is defined as an elliptic curve over the finite field of modulo of a number which is a large prime is a set of solutions to together with an extra point that is called the point at the infinity, where , belong to the finite field and satisfies the condition . The elliptic curve points together with the point form a cyclic group of addition with order. should be satisfied by , a base point and is the order of .
An Improved 2-Factor Authentication Scheme for WSN Based on ECC
Published in IETE Technical Review, 2023
Bhanu Chander, Gopalakrishnan Kumaravelan
Elliptic Curve Cryptography (ECC) is a special kind of public-key cryptography built on mathematically programmed elliptic curves that require smaller key sizes. Thus, it could be an appropriate target for resource-constrained situations. Famous well-known researchers Victor Miller projected ECC in 1885, then Neal Koblitz in 1985. An elliptic curve over a finite field demarcated as the set of every (x, y) ∈ Fp × Fp such that = + ax + b, here a, b ∈ Fp and mod p ≠ 0, and a prominent point at infinity which O. symbolizes. It should assume that the Gateway node is more computationally efficient than sensor nodes and holds a secured database where the list of registered sensor nodes is stored. In addition, every sensor node and Gateway node hoard their corresponding individualities in memory formerly than network placement.
A Comprehensive Survey on Certificateless Aggregate Signature in Vehicular Ad Hoc Networks
Published in IETE Technical Review, 2022
Eko Fajar Cahyadi, Min-Shiang Hwang
The elliptic curve cryptography (ECC), commonly used in cryptography, is an outstanding algorithm with incredibly high efficiency and relatively good security. Miller [54] and Koblitz [55] designed it for resource-constrained environments that offer equivalent security to RSA with far smaller key size. It requires less storage and hence reduces the processing overhead [37]. If is a field and is an elliptic curve, then is a group. For , we read it elliptic curve over field , which indicates the set of points on along with only a single addition operation defined for [56]. Therefore, it is impossible to multiply or divide elements of . The scalar multiplication algorithm is the most basic and time-consuming operation in the ECC, where is an integer, is a point defined on the elliptic curve on the field , and . It determines the ECC’s operation speed [57]. The elliptic curve discrete logarithm problem (ECDLP) complexity assumption built on ECC is discussed in the subsequent section.