Conferences related to Elliptic curves

Back to Top

2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )

ETFA focus is on the latest developments and new technologies in the field of industrial and factory automation. The conference aims to exchange ideas with both industry leaders and a variety of experienced researchers, developers, and practitioners from several industries, research institutes, and academia


GLOBECOM 2020 - 2020 IEEE Global Communications Conference

IEEE Global Communications Conference (GLOBECOM) is one of the IEEE Communications Society’s two flagship conferences dedicated to driving innovation in nearly every aspect of communications. Each year, more than 2,900 scientific researchers and their management submit proposals for program sessions to be held at the annual conference. After extensive peer review, the best of the proposals are selected for the conference program, which includes technical papers, tutorials, workshops and industry sessions designed specifically to advance technologies, systems and infrastructure that are continuing to reshape the world and provide all users with access to an unprecedented spectrum of high-speed, seamless and cost-effective global telecommunications services.


IECON 2020 - 46th Annual Conference of the IEEE Industrial Electronics Society

IECON is focusing on industrial and manufacturing theory and applications of electronics, controls, communications, instrumentation and computational intelligence.


2019 IEEE 19th International Symposium on High Assurance Systems Engineering (HASE)

Increasingly complex and interdependent systems require careful design to ensure continued operation in the presence of component failures, natural disasters, software/hardware vulnerabilities, and latent software errors. Often such systems are interdependent in complex ways implying that flaws in the design of one may affect the behavior of a system-of-systems. A key question then becomes "What design innovation is needed to bring about systems whose operation in accordance with functional and non-functional requirements is assured with a very high probability?" HASE 2018 will focus on this and related questions and answers which are of paramount importance to engineers who design and build interdependent complex systems that impact individuals, entire cities and even nations.


2019 IEEE 27th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)

The Symposium on Field-Programmable Custom Computing Machines is the original and premier forum for presenting and discussing new research related to computing that exploits the unique features and capabilities of FPGAs and other reconfigurable hardware. Over the past two decades, FCCM has been the place to present papers on architectures, tools, and programming models for field-programmable custom computing machines as well as applications that use such systems.


More Conferences

Periodicals related to Elliptic curves

Back to Top

Antennas and Propagation, IEEE Transactions on

Experimental and theoretical advances in antennas including design and development, and in the propagation of electromagnetic waves including scattering, diffraction and interaction with continuous media; and applications pertinent to antennas and propagation, such as remote sensing, applied optics, and millimeter and submillimeter wave techniques.


Broadcasting, IEEE Transactions on

Broadcast technology, including devices, equipment, techniques, and systems related to broadcast technology, including the production, distribution, transmission, and propagation aspects.


Circuits and Systems II: Express Briefs, IEEE Transactions on

Part I will now contain regular papers focusing on all matters related to fundamental theory, applications, analog and digital signal processing. Part II will report on the latest significant results across all of these topic areas.


Circuits and Systems Magazine, IEEE


Communications Letters, IEEE

Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)


More Periodicals

Most published Xplore authors for Elliptic curves

Back to Top

Xplore Articles related to Elliptic curves

Back to Top

ECC-Based Threshold Digital Signature Scheme without a Trusted Party

2008 International Conference on Computational Intelligence and Security, 2008

Based on the elliptic curve logarithm problem, a (t, n) threshold digital signature scheme was proposed in this paper. In the key generation phase, each participant¿s public and private keys, and the group public key are negotiated among all the participants with no trusted party required. In the signature generation phase, no secure communication is needed between any two participants. ...


An extended approach for securing the Short Messaging Services of GSM using multi-threading elliptical curve cryptography

2015 International Conference on Communication, Information & Computing Technology (ICCICT), 2015

Currently, mobile phones are not only used for formal communication but also for sending and receiving sensitive information. Short Messaging Service's(SMS) are one of the popular ways of communication. Sending an SMS is easy, quick and inexpensive. However, when information is exchanged using SMS, protecting the short messages from the known attacks like man in the middle attack, reply attack ...


A Security Scheme for Wireless Sensor Networks

2016 IEEE Global Communications Conference (GLOBECOM), 2016

Security is critical for wireless sensor networks (WSN)deployed in hostile environments since many types of attacks could reduce the trust on the global functioning of any WSN. Many solutions have been proposed to secure communications for WSNs and most of them rely on a centralized component which behaves as a certificate authority. We propose in this paper a distributed solution ...


HESSL (highly enhanced security socket layer) protocol

Seventh IEEE International Conference on E-Commerce Technology (CEC'05), 2005

SSL (secure socket layer) is currently the most widely deployed security protocol, and consists of many security algorithms, but it has some problems on processing time and security. This paper proposes an HESSL (highly enhanced security socket layer) protocol that provides better security and processing time than an existing SSL protocol. As HESSL consists of just F/sub 2m/ ECC (elliptic ...


An improved authentication and key agreement protocol preserving user's privacy using smart cards

2008 IEEE International Conference on Service Operations and Logistics, and Informatics, 2008

Recently, a privacy enhanced authentication and key agreement protocol was proposed using elliptic curve cryptograph technology. The scheme is insecure, however, against replay attacks within valid period of certificate and loses users' privacy that should be protected. In this paper we propose an improved authentication and key agreement protocol by employing smart card and random number technology. Replay attacks are ...


More Xplore Articles

Educational Resources on Elliptic curves

Back to Top

IEEE-USA E-Books

  • ECC-Based Threshold Digital Signature Scheme without a Trusted Party

    Based on the elliptic curve logarithm problem, a (t, n) threshold digital signature scheme was proposed in this paper. In the key generation phase, each participant¿s public and private keys, and the group public key are negotiated among all the participants with no trusted party required. In the signature generation phase, no secure communication is needed between any two participants. This scheme provides the capability of detecting cheating and identifying the cheat that may be from the internal participants or the external attackers. At the same time, this scheme has the advantages of elliptic curve cryptography. The security of this scheme is based on the difficulty of solving the elliptic curve discrete logarithm problem. Analyses show that this scheme is a computationally secure and efficient scheme.

  • An extended approach for securing the Short Messaging Services of GSM using multi-threading elliptical curve cryptography

    Currently, mobile phones are not only used for formal communication but also for sending and receiving sensitive information. Short Messaging Service's(SMS) are one of the popular ways of communication. Sending an SMS is easy, quick and inexpensive. However, when information is exchanged using SMS, protecting the short messages from the known attacks like man in the middle attack, reply attack and non-repudiation attack is very difficult. Such attacks on SMS security are hindering their application. This paper evaluates performance of elliptical curve cryptography by implementing it with threading and without threading. Based on the results of evaluation the one with the best performance is chosen for end to end SMS security.

  • A Security Scheme for Wireless Sensor Networks

    Security is critical for wireless sensor networks (WSN)deployed in hostile environments since many types of attacks could reduce the trust on the global functioning of any WSN. Many solutions have been proposed to secure communications for WSNs and most of them rely on a centralized component which behaves as a certificate authority. We propose in this paper a distributed solution able to ensure authentication of nodes at any time without having any on-line access to a certificate authority. Each node will be equipped with a Trusted Platform Module (TPM) which is able to store keys with security. Each node will have its own public key and private key pair in the TPM and a certificate of the public key. The certificate is issued off-line when setting-up the node. When a node communicates with another, it has to sign the message with its own private key (done securely by the TPM) and sends the message, the signature and the certificate of the public key. The evaluation of the solution has been done using simulation and the overhead added by integrating authentication does not exceed 15% of energy consumption.

  • HESSL (highly enhanced security socket layer) protocol

    SSL (secure socket layer) is currently the most widely deployed security protocol, and consists of many security algorithms, but it has some problems on processing time and security. This paper proposes an HESSL (highly enhanced security socket layer) protocol that provides better security and processing time than an existing SSL protocol. As HESSL consists of just F/sub 2m/ ECC (elliptic curve cryptosystem), F/sub 2m/ HECC, BSB, and SHA algorithm, this protocol reduces handshaking process by concatenating a shared private key of F/sub 2m/ ECC, F/sub 2m/ HECC and proposed BSB and improves processing time. In particular, BSB algorithm provides better confidentiality than those used by SSL because of four processes of byte-exchange key, shift round key, ASCII code key and bit-xor key after selecting two blocks randomly.

  • An improved authentication and key agreement protocol preserving user's privacy using smart cards

    Recently, a privacy enhanced authentication and key agreement protocol was proposed using elliptic curve cryptograph technology. The scheme is insecure, however, against replay attacks within valid period of certificate and loses users' privacy that should be protected. In this paper we propose an improved authentication and key agreement protocol by employing smart card and random number technology. Replay attacks are thus blocked without the need of time synchronization between computers. Moreover, we develop a secure mechanism to protect users' identity privacy and a convenient password change method without the participation of the server. Our protocol is more secure compared with others at similar computation cost in the authentication period.

  • Co-Z Addition Operation of Hessian Curve

    This paper presents a co-Z addition operation of Hessian curve, which costs 8M to add two different points with the same z coordinate. By using of this operation, we propose a new method of precomputation for windows-based scalar multiplication, which needs only one field inversion to compute all precomputation points in afflne coordinate. Compared with the known fastest method based on extended projective coordinate, when less than 45 registers are available in the scalar multiplication, the proposed method can save up to 2.6% by using the fractional wNAF.

  • Sliding window method with flexible window size for scalar multiplication on wireless sensor network nodes.

    Scalar multiplication is time consuming operation of ECC when implemented on wireless sensor nodes. The wireless sensor node consists of 8 bit micro controller and limited memory for the storage. The scalar multiplication process can be accelerated with the sliding window method which has two stages namely pre computation and an evaluation stage. Points for use in the evaluation stage are computed in the pre computation stage. The scalar multiplication is carried out in the evaluation stage with the addition of pre computed points. The number of pre computations depends on the window size of sliding window method. More is the window size, more are the pre computations and more is the memory required for the storage. This is the well-known draw- back of the sliding window method when implemented on WSN nodes. This research paper proposes sliding window method with flexible window size for scalar multiplication on wireless sensor nodes. The flexible window size will prevent sensor node failures due to stack overflow.

  • Message recovery signature scheme using complementary elliptic curves

    Elliptic curve cryptography is known for its complexity due to its discrete logarithm problem, and this gives advantage to the system used since the formula developed using this concept is hard to solved; therefore, this criteria has given mathematicians a courage to explore this area of research. In previous paper (Yew et al., 2003), we have shown a new method for embedding plain-texts using a complementary elliptic curve. In this paper we extend our work to obtain a new modified method for the Nyberg-Rueppel message recovery signature scheme using the complementary curve. By applying this method, we eventually enlarge the block of message of elliptic curve cryptosystems and this resulted in faster communication and processing time and at the same time the security level remain tight.

  • Securing E-passports with Elliptic Curves

    In this paper, security of ID documents (such as passports) is discussed. A class of cryptographic protocols called Password-Authenticated Key Exchange (PAKE) provides a more robust solution to this problem. PAKE protocols ensure that an eavesdropper can't learn any information on the low-entropy secret. They're also required to be as secure as possible against all passive and active attacks. Basically, all an adversary can do to learn the password is an online dictionary attack (guess the password and try to execute the protocol with one of the parties). We can prevent this through latency, smart card blocking, and so on. For implementing PAKE protocols, especially in constrained environments such as e-passports, elliptic-curve cryptography is fast and requires little memory. However, it involves representing numeric values (in this case, passwords) as points on an elliptic curve, and how to do this efficiently and se curely isn't obvious.

  • New Greedy Algorithm for Computing Double-Base Chains

    We improve the greedy algorithm which converts integers into double-base chains by introducing tree structure. The new method accelerates the convergence of greedy algorithm, which makes the double-base expansions shorter than before. And it reduces the cost of computing scalar multiplication on elliptic curves. Furthermore, new algorithm performs well in flexibility. We could adjust it to return more efficient expansions for scalar multiplication on special curves. We also discuss the impact of parameters on the performance of new method.



Standards related to Elliptic curves

Back to Top

No standards are currently tagged "Elliptic curves"


Jobs related to Elliptic curves

Back to Top