Recent progress on the elliptic curve discrete logarithm problem | Designs, Codes and
Cryptography Skip to main content SpringerLink Account Menu Find a journal Publish with us …

Symmetric and asymmetric cryptographic algorithms are used for a secure transmission of
data over an unsecured public channel. In order to use these algorithms in real-time …

Since it was invented in 1986, elliptic curve cryptography (ECC) has been studied widely in
industry and academy from different perspectives. Some of these aspects include …

Authentication, encryption, signatures, and key agreements are public key cryptography
(PKC) services required in certain Internet of Things (IoT) applications (such as healthcare …

This paper revisits a model for elliptic curves over ℚ introduced by Huff in 1948 to study a
diophantine problem. Huff's model readily extends over fields of odd characteristic. Every …

Template attacks are a special kind of side-channel attacks that work in two stages. In a first
stage, the attacker builds up a database of template traces collected from a device which is …

This paper considers a generalized form for Hessian curves. The family of generalized
Hessian curves covers more isomorphism classes of elliptic curves. Over a finite field F_q, it …

Efficient implementation of point multiplication is crucial for elliptic curve cryptographic
systems. This paper presents the implementation results of an elliptic curve crypto-processor …

In elliptic curve cryptography (ECC), hardware architectures of finite field (FF) multipliers are
frequently proposed for polynomial as well as for normal bases representations over GF (2 …

Flexibility is one of the driving agents for 5G architecture development to incorporate
enhanced mobile broad band, machine type communication (MTC), and ultra-reliable MTC …