35 results for “Secret Key”

Set a search alert

Research ArticleOpen accessIn the abstractKey Exchange Protocol in Elliptic Curve Cryptography with No Public PointK. Kaabneh, H. Al-BdourIn recent years some cryptographic algorithms have gained popularity due to properties that make them suitable for use in constrained environment like mobile information appliances, where computing resources and power availability are limited. One of these cryptosystems is Elliptic curve which requires less computational power, memory and communication bandwidth compared to other cryptosystem. This makes the elliptic curve cryptography to … …American Journal of Applied Sciences, Vol. 2, Issue 8 · 31 Aug 2005 · 7,067 accessesView PDF Cite

Research ArticleOpen accessIn the abstractDETECTING MULTIPLE INTRUSION ATTACKS USING PERMANENT GIRTH CLUSTERING MODEL IN WIRELESS SENSOR NETWORKG. Jayamurugan, P. KamalakkannanSecurity is the central challenge and one of the serious concerns for designing reliable sensor networks. Of the different types of security threats in wireless sensor network, particularly dangerous attack is the replica node attack, in which the opponent takes the secret keying materials from a compromised node. It then produces large number of attacker-controlled replicas that divide up the … …Journal of Computer Science, Vol. 10, Issue 8 · 1 Apr 2014 · 6,467 accessesView PDF Cite

Research ArticleOpen accessIn the abstractDevelopment of a New Elliptic Curve Cryptosystem with Factoring ProblemE. S. Ismail, M. S. HijaziProblem statement: The security of elliptic curve cryptosystems are based on elliptic curve discrete logarithm problem (ECDLP). However, if an attacker finds a solution to ECDLP, the elliptic curve-based systems will no longer be secure. Approach: To improve this, we develop a new elliptic curve cryptosystem using one of the old/novel problem in computational number theory; factoring problem (FAC). Specifically, … …American Journal of Applied Sciences, Vol. 9, Issue 9 · 2 Aug 2012 · 6,788 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA 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 PDF Cite

Research ArticleOpen accessAll words, across the recordGenetic Algorithm and Tabu Search Attack on the Mono-Alphabetic Substitution Cipher in Adhoc NetworksA. K. Verma, Mayank Dave, R. C. JoshiWith exponential growth of networked system and application such as e-Commerce, the demand for effective Internet security is increasing. Cryptology is the science and study of systems for secret communication. In consists of two complementary fields of study: cryptography and cryptanalysis. This study presents a cryptanalysis method based on Genetic Algorithm and Tabu Search to break a Mono-Alphabetic Substitution Cipher … …Journal of Computer Science, Vol. 3, Issue 3 · 31 Mar 2007 · 7,254 accessesView PDF Cite