Key generation based on elliptic curve over finite prime field

Vigila, S. Maria Celestin; Muneeswaran, K.

doi:10.1504/ijesdf.2012.045391

Cited by 7 publications

(4 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The mapping of key to a point on the EC is carried out in the initialization stage which increases the hardware and computational complexity and makes it less suitable for resource constrained applications. A key generation based on EC over finite prime field is published in 2012 [17]. The output is generated by truncating the -coordinate of the point = where is the random value from the LFSR and 's are points on the EC.…”

Section: Related Workmentioning

confidence: 99%

Pseudorandom Bit Sequence Generator for Stream Cipher Based on Elliptic Curves

Jilna

Deepthi

2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper proposes a pseudorandom sequence generator for stream ciphers based on elliptic curves (EC). A detailed analysis of various EC based random number generators available in the literature is done and a new method is proposed such that it addresses the drawbacks of these schemes. Statistical analysis of the proposed method is carried out using the NIST (National Institute of Standards and Technology) test suite and it is seen that the sequence exhibits good randomness properties. The linear complexity analysis shows that the system has a linear complexity equal to the period of the sequence which is highly desirable. The statistical complexity and security against known plain text attack are also analysed. A comparison of the proposed method with other EC based schemes is done in terms of throughput, periodicity, and security, and the proposed method outperforms the methods in the literature. For resource constrained applications where a highly secure key exchange is essential, the proposed method provides a good option for encryption by time sharing the point multiplication unit for EC based key exchange. The algorithm and architecture for implementation are developed in such a way that the hardware consumed in addition to point multiplication unit is much less.

show abstract

Section: Related Workmentioning

confidence: 99%

Pseudorandom Bit Sequence Generator for Stream Cipher Based on Elliptic Curves

Jilna

Deepthi

2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…The proposed pipelined Vedic multiplier has an optimized area, speed and throughput. The ECC based security systems are performing well against the attacks [37] such as algebraic attack, brute force attack and statistical attack [38,39] and protects confidential data hiding in spatial images [40].…”

Section: Cycle = Time For One Ecpm × Maximum Frequency At/bit = Area-...mentioning

confidence: 99%

Programmable implementation of time-area-efficient Elliptic Curve Cryptography for entity authentication

2022

Informacije MIDEM

View full text Add to dashboard Cite

The rise of wireless technologies, communications and devices, has resulted in the demand for effective security with low hardware requirements and high speed. Among the various cryptographic algorithms, the Elliptic Curve Cryptography (ECC) provides an attractive solution for this demand. In this paper, the Remote Keyless system (RKE) Authentication process using the ECC is implemented in Field Programmable Gate Array (FPGA). The designed ECC processor supports 256-bit point multiplication and point addition on the Koblitz curve secp256k1. The scalar multiplication is performed with the faster multiplier Urdhva Tiryagbhyam (UT). Additionally, pipelining is incorporated in order to speed up the multiplication process of the processor. The proposed ECC processor performs single point multiplication of 256-bit in 1.2062ms with a maximum clock frequency of 192.5MHz, which provides 212.23kbps throughput and occupies 8.23k slices in Virtex-7 FPGA. Incorporating a pipeline in scalar multiplication improves the maximum clock frequency up to 15.12%, which reduces time consumption by 22.36%, which in turn increases the throughput by 22.36%. The proposed pipelined Vedic multiplier based ECC processor outperforms the existing designs in terms of area, operating frequency, areadelay product and throughput. Also, the security evaluation and analysis of the proposed ECC processor are performed, which ensures the safety of RKE systems. Hence, the implementation of the proposed method offers time-area-efficient and fast scalar multiplication with effective hardware utilization without any compromise in security level.

show abstract

“…The pseudo-random sequence used for image encryption must have good randomness properties and high periodicity so that the encrypted image is secure. Recently, several attempts for using ECs in image encryption has been proposed in literature such as [28], [29], [30]. In this section, the pseudo-random sequences generated by the considered 14 schemes are used for encrypting a 256 × 256 grayscale Lena image in which each pixel has a 8-bit value of between 0 and 255 and the security analysis of the ciphered images are carried out.…”

Section: Image Encryption Application Examplementioning

confidence: 99%

Pseudo-random Sequence Generation from Elliptic Curves over a Finite Field of Characteristic 2

Reyad

Kotulski

2016

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

Abstract-In this paper, the randomness of binary sequences generated from elliptic curves over a finite field of characteristic 2 is studied. A scheme of construction based on the ChaosDriven Elliptic Curve Pseudo-random Number Generator (C-D ECPRNG) is proposed. The generators based of this scheme are verified by using tests from the NIST Statistical Test Suite to analyze their statistical properties. An elliptic curve used in the numerical example is defined over F 2 8 . The investigations which made for the generated series of two output sequences of the lengths of 2 10 and 2 20 bits shown that 14 generators working according to our general scheme exhibit good randomness properties. Next, the binary sequences generated by these 14 schemes were used for encrypting a 256 × 256 grayscale Lena image as an application example and the security analysis of the ciphered images was carried out.

show abstract

Key generation based on elliptic curve over finite prime field

Cited by 7 publications

References 19 publications

Pseudorandom Bit Sequence Generator for Stream Cipher Based on Elliptic Curves

Pseudorandom Bit Sequence Generator for Stream Cipher Based on Elliptic Curves

Programmable implementation of time-area-efficient Elliptic Curve Cryptography for entity authentication

Pseudo-random Sequence Generation from Elliptic Curves over a Finite Field of Characteristic 2

Contact Info

Product

Resources

About