Enhanced Security Authentication of WiMAX using EC3A

2017 ◽  
Vol 7 (8) ◽  
pp. 219
Author(s):  
Mohd Javed ◽  
Khaleel Ahmad ◽  
Ahmad Talha Siddiqui
Keyword(s):  
Cellular Automata ◽  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Information Rate ◽  
Security Authentication ◽  
Encryption And Decryption ◽  
High Information

WiMAX is the innovation and upgradation of 802.16 benchmarks given by IEEE. It has numerous remarkable qualities, for example, high information rate, the nature of the service, versatility, security and portability putting it heads and shoulder over the current advancements like broadband link, DSL and remote systems. Though like its competitors the concern for security remains mandatory. Since the remote medium is accessible to call, the assailants can undoubtedly get into the system, making the powerless against the client. Many modern confirmations and encryption methods have been installed into WiMAX; however, regardless it opens with up different dangers. In this paper, we proposed Elliptic curve Cryptography based on Cellular Automata (EC3A) for encryption and decryption the message for improving the WiMAX security

RGB-Based Secure Share Creation in Visual Cryptography Using Optimal Elliptic Curve Cryptography Technique

2016 ◽  
Vol 25 (11) ◽  
pp. 1650138 ◽  
Author(s):  
K. Shankar ◽  
P. Eswaran
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Signal To Noise Ratio ◽  
Optimization Technique ◽  
Visual Cryptography ◽  
Cuckoo Search ◽  
Test Results ◽  
The Public ◽  
Encryption And Decryption ◽  
The Mean

Many shares are generated from the secret images that are illogical containing certain message within them in visual cryptography. When all shares are piled jointly, they tend to expose the secret of the image. The multiple shares are used to transfer the secret image by using the encryption and decryption process by means of the elliptic curve cryptography (ECC) technique. In ECC method, the public key is randomly generated in the encryption process and decryption process, the private key ([Formula: see text]) is generated by utilizing the optimization technique and for evaluating the performance of the optimization by using the peak signal to noise ratio (PSNR). From the test results, the PSNR has been exposed to be 65.73057, also the mean square error (MSE) value is 0.017367 and the correlation coefficient (CC) is 1 for the decrypted image without any distortion of the original image and the optimal PSNR value is attained using the cuckoo search (CS) algorithm when compared with the existing works.

scholarly journals Elliptic Curve Cryptosystem for Email Encryption

2010 ◽  
pp. 230-235
Author(s):  
Abhijit Mitra ◽  
Saikat Chakrabarty ◽  
Poojarini Mitra
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Galois Field ◽  
Elliptic Curve Cryptosystem ◽  
Public Network ◽  
Plain Text ◽  
The Core ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Secure Transmission

The idea of information security lead to the evolution of cryptography. In other words, cryptography is the science of keeping information secure. It involves encryption and decryption of messages. The core of cryptography lies in the keys involved in encryption and decryption and maintaining the secrecy of the keys. Another important factor is the key strength, i.e. the difficulty in breaking the key and retrieving the plain text. There are various cryptographic algorithms. In this project we use Elliptic Curve Cryptography (ECC) over Galois field. This system has been proven to be stronger than known algorithms like RSA, DSA, etc. Our aim is to build an efficient elliptic curve cryptosystem for secure transmission or exchange of confidential emails over a public network.

An Efficient Parallel Montgemery Cryptography for Multi-Core Processor

2013 ◽  
Vol 385-386 ◽  
pp. 1804-1807
Author(s):  
Shi Ji Yuan ◽  
Ming Feng Sun ◽  
Zhi Hua Liu ◽  
Wen Jing Huang
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Processing Efficiency ◽  
Loop Unrolling ◽  
Data Parallel ◽  
Montgomery Ladder ◽  
Encryption And Decryption ◽  
Using Data ◽  
Multi Core Processor ◽  
And Task

The classical Montgomery ladder algorithm (MPL) is an effective way to improve the operational efficiency of elliptic curve cryptography. First, an improved MPL is proposed by loop unrolling, and then the Montgomery elliptic curve encryption and decryption process is realized using data parallel and task parallel. The experimental results show that the ratio of acceleration parallel processing efficiency can reach 70%, and the method can effectively improve the speed of elliptic curve encryption algorithm.

scholarly journals A COMPARATIVE ANALYSIS OF ECDSA V/S RSA ALGORITHM

2014 ◽  
pp. 7-9
Author(s):  
AMANPREET KAUR ◽  
VIKAS GOYAL
Keyword(s):  
Elliptic Curve ◽  
Finite Fields ◽  
Elliptic Curve Cryptography ◽  
Public Key Cryptography ◽  
Cryptographic Primitives ◽  
Prime Field ◽  
Rsa Algorithm ◽  
Encryption And Decryption ◽  
Security Problem ◽  
Accurate Observation

Elliptic curve Cryptography with its various protocols implemented in terms of accuracy and fast observation of results for better security solution. ECC applied on two finite fields: prime field and binary field. Because it is public key cryptography so, it also focus on generation of elliptic curve and shows why finite fields are introduced. But for accurate observation we do analysis on category of cryptographic primitives used to solve given security problem. RSA & ECDSA both have basic criteria of production of keys and method of encryption and decryption in basic application as per security and other properties which are authentication, non-repudiation, privacy, integrity.

scholarly journals Cryptography in Terms of Triangular Neutrosophic Numbers with Real Life Applications

2020 ◽  
pp. 39-52
Author(s):  
admin admin ◽  
◽  
◽  
◽  
◽  
...  
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Information Transfer ◽  
Real Life ◽  
Public Key Cryptography ◽  
Public Key ◽  
Encryption And Decryption ◽  
Basic Concepts ◽  
Triangular Neutrosophic Numbers

In this article, our main focus is to put forward the concept of Cryptography in terms of triangular neutrosophic numbers. This kind of cryptography is really reliable, manual, secure, and based on few simple steps. All the encryption and decryption are easy to proceed (mention below). As we know, Public-key cryptography as an indefatigable defender for human privacy and use as information transfer from the ages. various concepts are available with regard to cryptography e.g. Elliptic curve cryptography. TNNC (Triangular neutrosophic numbers cryptography) is familiar with basic concepts of math as well as applicable in different situations e.g. code cryptography, detailed view cryptography, and Graph cryptography encryption facilitate.

Study of Safe Elliptic Curve Cryptography over Gaussian Integer

2020 ◽  
Vol E103.A (12) ◽  
pp. 1624-1628
Author(s):  
Kazuki NAGANUMA ◽  
Takashi SUZUKI ◽  
Hiroyuki TSUJI ◽  
Tomoaki KIMURA
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Gaussian Integer
Sign in / Sign up

Export Citation Format

Share Document