Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

30 articles for “Elliptic Curve Cryptography”
Set a search alert
Research ArticleOpen accessIn the abstractTPAL: A Protocol for Node Authentication in IoTMohamad Faiz Razali, Mohd Ezanee Rusli, Norziana Jamil, Salman YussofSecure communication in Low power and Lossy Network (LLN) requires the authentication of the identities of nodes for that node to join the network. Since LLN may consist of many different nodes, where some nodes may contain sensitive and subtle information such as military data, monitoring data, or health data, that node needs to be authenticated before it can deliver … …Journal of Computer Science, Vol. 14, Issue 10 · 30 Oct 2018 · 7,026 accessesView PDFCite
Research ArticleOpen accessIn the abstractDevelopment of an Energy-Efficient, Secure and Reliable Wireless Sensor Networks Routing Protocol Based on Data Aggregation and User AuthenticationA. Gopi Saminathan, S. KarthikData aggregation protocols are required in Wireless Sensor Networks (WSNs) to improve the data accuracy and extend the network lifetime by reducing the energy consumption. The existing Data Aggregation-Optimal LEACH (DAO-LEACH) protocol for WSN is enhanced in terms of security and fault-tolerance based on Gracefully Degraded Data Aggregation (GDDA) to ensure the integrity of the aggregated data and Hybrid Layer … …American Journal of Applied Sciences, Vol. 10, Issue 8 · 24 Jul 2013 · 6,855 accessesView PDFCite
Research ArticleOpen accessIn the abstractA New Scalable and Reliable Cost Effective Key Agreement Protocol for Secure Group CommunicationS. Jabeen Begum, Dr. T. PurusothamanProblem statement: In a heterogeneous environment, for a secure multicast communication, the group members have to share a secret key which is used to encrypt/decrypt the secret messages among the members. The Secure Group Communication of large scale multicast group in a dynamic environment is more complex than securing one-to-one communication due to the inherent scalability issue of group key … …Journal of Computer Science, Vol. 7, Issue 3 · 7 Mar 2011 · 6,960 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Cryptosystem Using the Concepts of Algebraic Geometric CodeK. V. Pramod, C. ManjuProblem statement: Cryptosystem using linear codes was developed in 1978 by Mc-Eliece. Later in 1985 Niederreiter and others developed a modified version of cryptosystem using concepts of linear codes. But these systems were not used frequently because of its larger key size. In this study we were designing a cryptosystem using the concepts of algebraic geometric codes with smaller key … …Journal of Computer Science, Vol. 6, Issue 3 · 31 Mar 2010 · 7,444 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordA MODIFIED ELLIPTIC CURVE DIGITAL SIGNATURE ALGORITHM FOR PUBLIC VERIFIABILITY WITH DATA DYNAMICS IN CLOUD COMPUTINGD. Sumathi, Ramachandra V. PujeriCloud storage is considered to be the most critical factor in decision making for users as it largely scales down the infrastructure in terms of size, cost and design. Considering factors such as local storage cost, maintenance a single server model can support multiple users on a needed basis. This raises concerns for integrity verification i.e., assuring the correctness of … …Journal of Computer Science, Vol. 10, Issue 10 · 28 Jun 2014 · 6,486 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordSecure Hybrid Mode-Based CryptosystemE. S. Ismail, S. BaharudinProblem statement: A cryptosystem provides two parties; a sender and a receiver to communicate interactively via an insecure channel in which, the sender is able to send any confidential message, document or data in a disguised form to the intended receiver. Upon receiving the disguised message, the receiver converts it to the intelligible message using his secret key. The security … …American Journal of Applied Sciences, Vol. 9, Issue 3 · 12 Jan 2012 · 7,003 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordNew Cryptosystem Using Multiple Cryptographic AssumptionsE. S. Ismail, M. S. HijaziProblem statement: A cryptosystem is a way for a sender and a receiver to communicate digitally by which the sender can send receiver any confidential or private message by first encrypting it using the receiver’s public key. Upon receiving the encrypted message, the receiver can confirm the originality of the message’s contents using his own secret key. Up to now, … …Journal of Computer Science, Vol. 7, Issue 12 · 15 Oct 2011 · 7,061 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordA New Cryptosystem Based on Factoring and Discrete Logarithm ProblemsE.S. Ismail, M.S.N. HijaziProblem statement: A cryptosystem allows a sender to send any confidential or private message using a receiver’s public key and later the receiver confirms the integrity of the received message using his secret key. Currently the existing cryptosystems were developed based on a single hard problem like factoring, discrete logarithm, residuosity, knapsack or elliptic curve discrete logarithm. Although these schemes … …Journal of Mathematics and Statistics, Vol. 7, Issue 3 · 18 Jul 2011 · 7,786 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordReconfigurable Elliptic Curve Crypto-Hardware Over the Galois Field GF(2163)Mohamed Abdelkader Bencherif, Hamid Bessalah, Abderrezak GuessoumProblem statement: In the last decade, many hardware designs of elliptic curves cryptography have been developed, aiming to accelerate the scalar multiplication process, mainly those based on the Field Programmable Gate Arrays (FPGA), the major issue concerned the ability of embedding this strategic and strong algorithm in a very few hardware. That is, finding an optimal solution to the one … …American Journal of Applied Sciences, Vol. 6, Issue 8 · 31 Aug 2009 · 7,346 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordA New Digital Signature Scheme Based on Factoring and Discrete LogarithmsE.S. Ismail, N.M.F. Tahat, R.R. AhmadProblem statement: A digital signature scheme allows one to sign an electronic message and later the produced signature can be validated by the owner of the message or by any verifier. Most of the existing digital signature schemes were developed based on a single hard problem like factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems. Although these schemes … …Journal of Mathematics and Statistics, Vol. 4, Issue 4 · 31 Dec 2008 · 7,259 accessesView PDFCite