Hyperelliptic Curve Cryptography Research Articles

Development of Secure Cloud Based Storage Using the Elgamal Hyper Elliptic Curve Cryptography with Fuzzy Logic Based Integer Selection

The technological advancements in the field of the information and communication technology led to the development of more promising cloud paradigm that allows online provision of services such as platform, software and infrastructure. The infrastructure services provided by the cloud allows the user data to be stored and accessed ubiquitously unlike the arrays that are available on the premises. However the security of the data that are being stored in the internet are still under research. This remains as major inhibitor for the adoption of cloud service in spite of its reliability, elasticity, high computational capabilities and the pay as you go possibilities. So the paper puts forth the construction of a secure storage as service in the cloud computing by utilizing the cryptography system based on Elgamal. The proposed method encrypts the data to be stored using the Elgamal that incorporates the hyper elliptic curve cryptography for twofold encryption and further utilizes the fuzzy logic to perform the integer selection that serves as the significant attribute in defining the cloud storage security. The point addition and the double based ECC is used for generating the keys for the hyper elliptic curve cryptography. The twofold security model put forth is validated using the MATLAB on the terms of efficiency observed on securing the data stored in cloud as well as the cost and the execution time endured by the proposed twofold security. The results shows that the protection offered by the twofold security is much better compared to the prevailing.

H3-hybrid multilayered hyper chaotic hyper elliptic curve based image encryption system

Excessive need for digitized images in all domains have necessitated the need for protecting the images against adversaries for secured transmission in the network. Sensitive images processed in medical, crime investigations are presumed to be highly due its sensitive nature. As per the state of art encryption methodologies are not exclusively designed for color images and simply extended from the one established for gray images. A multilayered hybrid model has been proposed and named as Hybrid multilayered Hyper-chaotic Hyper-elliptic curve based image encryption (HHH) scheme to handle color images used in medical and forensic domains. In the first layer, hyper chaotic based DNA encoding is implemented to generate chaotic sequences. Substitution permutation increases confusion diffusion level to increase the security strength of crypto system. In the second layer, Genus-2 Hyper Elliptic Curve Cryptography over GF(p) that emphasis spatial domain for encryption has been employed for its mathematical strength. The proposed HHH system is hybrid in nature as it combines symmetric and asymmetric cryptosystem. All sort of signal processing mechanisms that include susceptible colored images can be benefited with this approach as the experimental results endorse ideal measure for PSNR, entropy, NPCR, UACI and MSE values tested with standard bench mark images.

An Efficient and Provably Secure Certificateless Key-Encapsulated Signcryption Scheme for Flying Ad-hoc Network

A Flying Ad-hoc Network (FANET) consists of Unmanned Aerial Vehicles (UAVs) tasked to handle the communication jobs in a multi-hop ad-hoc fashion. Unlike its predecessors, i.e. Mobile Ad-hoc Networks (MANETs) and Vehicular Ad-hoc Networks (VANETs), a FANET promises uninterrupted connectivity, especially during events that are temporary and stipulate a massive audience reach. However, usually, the participating UAVs in a FANET environment are resource-constrained and are, therefore, prone to cyber-attacks. In order to resolve the issue and to enable a secure communication between the UAVs and the Base Station (BS), we propose a Certificateless Key-Encapsulated Signcryption (CL-KESC) scheme. The scheme is based on the concept of Certificateless Public Key Cryptography (CL-PKC). Since CL-PKC is immune to key escrow problems and thus one of the major drawbacks of the Identity-based Public Key Cryptography (ID-PKC) is addressed. Unfortunately, the existing construction models of CL-KESC rely on elliptic curve-based operations, which are computationally expensive for small UAVs. To counter the issue, in this paper, we present a new construction model of CL-KESC based on Hyperelliptic Curve Cryptography (HECC). HECC is an advanced version of the elliptic curve and is characterized by smaller parameter and key size. The key size stretches to a maximum of 80-bits, as opposed to the elliptic curve that demands a 160-bits key size. The proposed scheme proved to be superior, chiefly in terms of security and performance, as demonstrated by the results obtained from the security verification and by carrying out comparative analysis with the existing counterparts.

A Lightweight and Secure Attribute-Based Multi Receiver Generalized Signcryption Scheme for Body Sensor Networks

With the rising number of patients along with the same time, the comparative evolution in wireless technology has made Body Sensor Networks (BSNs) flourishing in the market. In BSNs, tiny biosensor nodes are deployed inside/outside of a human body to continuously monitor patient vital signs such as heartbeat rate, blood pressure, respiratory rate, and temperature. BSNs face various challenges due to their constrained nature environment. These are prioritized, delaying less, and secure patient data transmission using a public network, simultaneous reception of patient data by end-users, patient identity privacy, high overhead, and energy constraints. However, various researchers have worked in this domain, unable to cope with all these issues in one go. In this paper, we have proposed a novel cryptosystem covering the mentioned issues in a desirable way. For this purpose, we offer a novel concept of a lightweight and secure attribute-based multi-receiver generalized signcryption scheme that can adaptively work as an encryption mode, a signature mode, or a signcryption mode with a single algorithm that consume fewer resources by using shorter keys size of Hyper-elliptic Curve Cryptography (HECC). Similarly, we design a modified priority-based scheduling algorithm to delay less emergency patient data. Multiple end-users access the encoded data simultaneously by defining an access policy using AND & OR logic gates. Furthermore, we simulate our scheme using the AVISPA tool and demonstrate that our proposed scheme can meet the security requirements such as data confidentiality (IND-CCA), integrity, unforgeability (EUF-CMA), patient data authenticity, forward secrecy, and non-repudiation distinctly in the Random Oracle Model (ROM). Due to lower processing costs and transmission overhead, this scheme is more efficient and suitable for the resource-constrained environment of BSNs.

Hyper Elliptical Curve Cryptography (Hecc) For Cloud

This system provides an insight into developing a distributed system which is secure, robust and user friendly. This thesis suggests a design and implementation of a digital envelope that combines the hashing algorithm of MD5, the symmetric key algorithm of AES and the asymmetric key algorithm of Hyper Elliptic Curve. A hybrid algorithm is designed, combining the best of both AES and ECC over GF(p) cryptography. The MD5 hash algorithm is adopted to ensure integrity of the data. Cryptography (HECC). This paper discusses securing the data in clouds through implementing the key for encryption and decryption using hyper elliptical curve cryptography. The focus is on Advanced Encryption Standard (AES), the most commonly used secret key cryptographic algorithm, and Hyper Elliptic Curve Cryptography (HECC), public key cryptographic algorithms which have gained popularity in the recent years and are replacing traditional public key cryptosystems, such as RSA and ECC. Such techniques are necessary in order to use high security cryptographic algorithms in real world applications.

Efficient Scheduling Mechanisms for Secured Cloud Data Environment

Big Data has won heaps of intrigue in light of the tremendous degree it presents for a higher comprehension of the business and decision making strategy for an enterprise. There has been a broad scope of looks into happening far and wide on this to make the most out of it and entirely some of specialized stages are to be need to the analysis for enormous records . However, Scientists and organizations had the option to expand frameworks that could deal with the enormous measurements and perform investigation on it, the security segments remain immensely immaculate. And misfortune can be a reason for significant data loss while applying hybrid security. As if information changes, then it is not valuable. So here is a need to adopt proper scheduling mechanism in cloud computing to avoid process delay. This paper expounds some encryption strategies and proper scheduling mechanisms. Hyper elliptic curve cryptography (HECC) towards verified enormous record analyses is embraced here to describe with proper scheduling

An Energy Efficient and Formally Secured Certificate-Based Signcryption for Wireless Body Area Networks with the Internet of Things

Recently, the spectacular innovations in the fields of wireless body area networks (WBAN) and the Internet of Things (IoT) have made e-Care services rise as a promising application domain, which significantly advances the quality of the medical system, however, due to the openness of the wireless environment and privacy of people’s physiological data, WBAN and IoT are prone to various cyber-attacks. There is a significant need for an efficient and highly secured cryptographic scheme that can meet the requirements of resource-constrained devices. Therefore, in this paper, we propose a certificate-based signcryption (CB-SN) scheme for the IoT-enabled WBAN. The proposed scheme is based on the concept of hyper-elliptic curve cryptography (HECC) that offers the same level of security as the elliptic curve and bilinear pairing with lower-key size. The formal security verification using the Automated Validation of the Internet Security Protocols and Applications (AVISPA) tool along with informal security analysis demonstrate that the proposed scheme is not just reducing the complexity of resource-constrained IoT devices, but proves to be secure against several well-known cryptographic attacks. Moreover, performance comparison with relevant existing schemes authenticates that the proposed scheme is far more secure and energy efficient.

An Efficient Signcryption Scheme for Secure Authentication using Hyper Elliptic Curve Cryptography and Keccak Hashing

The need for security is a challenging task nowadays due to the transition from wired to wireless networks, emergence of Internet of Things (IoT), Mobile Networks, Wireless Sensor Networks (WSN) and Radio Frequency Identification System (RFID). Generally wireless systems are prone to insecurity and resource (power) constraint, to deal with these challenges many solutions has been proposed in cryptography. One such important development is light weight cryptography particularly signcryption.Signcryption is a logical combination of digital signature and encryption in a single step therefore the cost of communication and computation is very less compared to the existing signature then encryption scheme. Till date many signcryption techniques were raised based on El-Gamal, RSA and Elliptic Curve Cryptography (ECC). The proposed research work highlights the limitations of existing signcryption based on ECC and it proposes the efficient light weight cryptographic scheme of signcryption based on Hyper Elliptic Curve Cryptography (HECC) and Keccak hashing. Further the proposed research work achieves all the security metrics such as confidentiality, integrity, non- repudiation, forward secrecy and public verifiability.

Improved Hyper Elliptic Curve Cryptography with Hybrid Bat Algorithm for Tasks Replication to Meet Deadlines in Clouds

Improved Hyper Elliptic Curve Cryptography with Hybrid Bat Algorithm for Tasks Replication to Meet Deadlines in Clouds

SNAP-compressive lossless sensitive image authentication and protection scheme based on Genus-2 hyper elliptic curve

Hyper Elliptic Curve Cryptography (HECC) offers comparable security as that of Elliptic Curve Cryptography (ECC) even with much reduced key size. This reduction in key size minimizes processing overhead and hence is particularly more attractive for the constrained environment, key agreement protocols, and digital signature applications. In the digital communication world, the most dominant communication happens in Image form, which is highly sensitive as they possess biometric information or individual’s privacy information like medical history. As images consume large storage, it needs to be compressed for faster processing before encryption without compromising security. This, of course, incurs additional overhead at the receiver end along with data loss. To minimize storage space by compression without any loss of data and to speed up the encryption process without compromising security a lightweight model named SNAP (SeNsitive image Authentication Protection) has been proposed. This SNAP employs genus-2 HECC that can be constructed on 80-bit finite field to attain security features as compared with 160 bit ECC or 1024 bit RSA. Since HECC comes under Discrete Logarithm Problem (DLP) based cryptography, solving the DLP with the prime field of size 256 bits is not feasible with modern quantum computing power. It compresses the points of the chosen curve to divisor by using Mumford representation. This representation can perform compression without any loss which is desirable for ensuring sensitive protection. As HECC processing relies on divisors rather than points, it is faster than EC based image encryption. Rigorous security analysis has been conducted on the proposed SNAP model. The observed results claim ideal measures for MSE and PSNR values in comparison against a contemporary benchmark image encryption scheme. Security strength of the SNAP method has been ratified by examining key space analysis, entropy analysis, NPCR, and UACI analysis. The proposed method can be recommended as a good candidature as it out-performs in all the above performance measures from the security perspective.

Hybrid Key Management Scheme for Heterogeneous Wireless Sensor Networks

Wireless sensor network (WSN) is a large scale network with thousands of tiny sensor nodes deployed in the field which is widely used in real time applications. The greatest issue in wireless sensor network is secure key establishment and communication. In this paper, hybrid key management scheme is proposed for heterogeneous WSN. Initially the keys are generated and pre-distributed into sensor nodes using hyper elliptic curve equation. After the deployment, the node tries to form a cluster and then establishes a symmetric key using orthogonal Latin square method, where the cluster heads and base station use public key encryption method based on hyper elliptic curve cryptography (HECC). The simulation results show that the proposed scheme is better in terms of robustness, connectivity and lesser computational overhead with reduced key size.

RETRACTION: Cryptanalysis and enhancement of multi factor remote user authentication scheme based on signcryption

<p style='text-indent:20px;'>Advances in Mathematics of Communications, (2020)</p><p style='text-indent:20px;'>This paper is retracted by decision of one of the Editors in Chief of the journal Advances in Mathematics of Communications.</p>

Incorporating privacy and security in military application based on opportunistic sensor network

Wireless ad-hoc and sensor networks (WASN) or opportunistic sensor networks (Oppnets) have been improving their availability in providing secure communication between military candidates in military applications. The existing work has not addressed this issue effectively. This paper proposes secure route selection and three different encryption algorithms for Commando-Commando (CC), Soldier-Soldier (SS) and Commando-Soldier (CS) communication. Routing is based on path protected hop-by-hop routing protocol (PPHH) by which a secure path is selected with authentication by certificate authority (CA). The cryptography algorithms used are code-based cryptography, hyperelliptic curve cryptography, and design-based cryptography. The proposed strategy in this paper shows improvements in security, energy consumption, throughput, packet overhead and network reliability.

AN ACCESS CONTROL PROTOCOL FOR CLOUD DATA USING SECURED HYPER ELLIPTIC CURVE CRYPTOGRAPHY.

31Aug 2016 Access Control Protocol applied in cloud to enhance security using Hyper Elliptic Curve Cryptography Selvi S. and M. Gobi PSG College of Arts and Science, Coimbatore. Chikkanna Government Arts College, Tripur.

An Improved Level of Security for DNA Steganography Using Hyperelliptic Curve Cryptography

Steganography is the art of science of hiding information which is more useful in many social networks, digital media, and printing material. Many hiding algorithms are used to flourish the security level of the recent wireless multimedia system to protect the data from an attacker. This paper describes about existing steganographic based hiding methods using LSB techniques, RSA algorithm, DNA cryptography and DNA steganography, which is used to prevent copying, forgery and unauthorized access of videos, audios and images. Existing hiding methods had demerit of increased key size, computational cost, speed and size of the input. Thus the DNA steganography based Hyperelliptic Curve Cryptography (HECC) is proposed which provides a higher level of security to image file and also assure the digital media security. The proposed HECC based DNA steganography is compared with traditional cryptographic techniques results in 30 and 42 % increased processing time for encryption process and decryption process respectively. Finally, the proposed scheme is compared with other traditional steganographic technique in terms of Mean Square Error, Peak Signal to Noise Ratio (PSNR), embedding capacity. From the simulation results, it is inferred that, the proposed steganographic method has, the less embedding capacity, high MSR and PSNR value compared with other steganographic methods.

Biometric Signcryption using Hyperelliptic Curve and Cryptographically Secure Random Number

The biometric system stores physiological traits of user such as finger print, iris, palm, patterns of veins etc. Iris signcryption is the most successful way to improve the information security because iris consists of most accurate features compared to other authentication systems. In order to provide better security and less computational time lightweight cryptographic scheme called signcryption has introduced. Signcryption is a logical combination of encryption and signature. Cryptographically secure random numbers are used as private key in encryption segment and as key in generating signature of SHA-1 segment. Generally the random numbers passing the NIST Test suite fails to satisfy cryptographically secure requirements. An approach called twining technique along with AES in counter mode is used to generate cryptographically random numbers from the seed values of sensors. Twining technique is a novel method to minimize co linearity that occurs while extracting seed from multiple sensors housed in same environment. One of the most recent researches in the area of public key cryptography is Hyper Elliptic Curve Cryptography (HECC) because HECC uses smaller key size and less computational time. In the proposed biometric signcryption, biometric data, HECC and cryptographically secure random numbers are used to derive the signcrypted value of iris.

Bisection for genus 2 curves with a real model

Integer multiplication in Jacobians of genus $2$ curves over a finite field $\mathbb{F}_q$ is a fundamental operation for hyperelliptic curve cryptography. Algorithmically, the result of this operation is given by the very well known algorithms of Cantor. One method to reverse duplication in these cases consists in associating, to every preimage of the desired doubled divisor defined over $\mathbb{F}_q$, a root in $\mathbb{F}_q$ of the so called bisection polynomial. We generalize this approach to genus $2$ curves with two points at infinity, both in even and odd characteristics. We attach a bisection polynomial to each possible type of Mumford coordinate, we show the factorization of these in terms of Galois orbits in the set of bisections, and we compare the efficiency of our approach versus brute-force adaptations of the existing methods to our setting.

Data Security Model Employing Hyperelliptic Curve Cryptography (HECC) and Secure Hash Algorithm-3 (Sha-3) in Cloud Computing

Data Security Model Employing Hyperelliptic Curve Cryptography (HECC) and Secure Hash Algorithm-3 (Sha-3) in Cloud Computing

Data Security Model Employing Hyperelliptic Curve Cryptography (HECC) and Secure Hash Algorithm-3 (Sha-3) in Cloud Computing

Data Security Model Employing Hyperelliptic Curve Cryptography (HECC) and Secure Hash Algorithm-3 (Sha-3) in Cloud Computing

Flexible Prime-Field Genus 2 Hyperelliptic Curve Cryptography Processor with Low Power Consumption and Uniform Power Draw

This paper presents an energy -efficient (low power) prime-field hyperelliptic -curve cryptography (HECC) processor with uniform power draw. The HECC processor performs divisor scalar multiplication on the Jacobian of genus 2 hyperelliptic curves defined over prime fields for arbitrary field and curve parameters. It supports the most frequent case of divisor doubling and addition. The optimized implementation, which is synthesized in a 0.13 mm standard CMOS technology, performs an 81 -bit divisor multiplication in 503 ms consuming only 6.55 mJ of energy (average pow er consumption is 12.76 mW.) We also present a technique to make the power consumption of the HECC processor more uniform and lower the peaks of its power consumption .