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 PDFCite
Research ArticleOpen accessAll words, across the recordCarving Secret Messages out of Public InformationNaya Nagy, Marius Nagy, Selim G. AklThis study shows that secret information can be shared or passed from a sender to a receiver even if not encoded in a secret message. In the protocol designed in this study, no parts of the original secret information ever travel via communication channels between the source and the destination, no encoding/decoding key is ever used. The two communicating partners, … …Journal of Computer Science, Vol. 11, Issue 1 · 25 Feb 2015 · 8,037 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordENHANCING SECURITY FOR IPV6 NEIGHBOR DISCOVERY PROTOCOL USING CRYPTOGRAPHYRosilah Hassan, Amjed Sid Ahmed, Nur Effendy OsmanInternet Protocol version 4 (IPv4) would gradually be replaced by Internet Protocol version 6 (IPv6) as the next generation of Internet protocol. The Neighbor Discovery Protocol (NDP), one of the main protocols in the IPv6 suite, comprises Neighbor Discovery for IPv6. NDP is used by both hosts and routers. Its functions include Neighbor Discovery (ND), Router Discovery (RD), Address Auto … …American Journal of Applied Sciences, Vol. 11, Issue 9 · 3 Jul 2014 · 7,703 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordA NOVEL SUBSTITUTION BOX DESIGN FOR HUMMING BIRD-2 AGAINST SIDE CHANNEL ATTACKT. Blesslin Sheeba, P. RangarajanThe side-channel attacks are one of the effortless and commanding attacks against cryptographic implementation and their intention vary from protocols, modules, primitives and system. As a result of this attack, a serious threat to the security of cryptographic module was encountered. In effect, realization of the cryptographic algorithm has to take some countermeasure to resist against this type of attacks. … …Journal of Computer Science, Vol. 10, Issue 9 · 23 Apr 2014 · 6,590 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordA Framework for Group Key Management Protocol Assessment Independent of View SynchronyDavid Manz, Paul Oman, Jim Alves-FossProblem statement: As group key management extended into the area of large dynamic networks, complex issues emerged involving the many operations that run over several network topologies. The issues that occurred due to multiple topologies were also compounded by differing views of the network, taken at different time slices or positions within the network. This was especially complex when figuring … …Journal of Computer Science, Vol. 6, Issue 3 · 31 Mar 2010 · 6,942 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordQuantum Key Distribution Using Decoy State ProtocolSellami Ali, Shuhairi Saharudin, M. R.B. WahiddinProblem statement: Quantum key distribution provides unconditional security guaranteed by the fundamental laws of quantum physics. Unfortunately, for real-life experimental set-ups, which mainly based on faint laser pulses, the occasional production of multi-photons and channel loss make it possible for sophisticated eavesdroppers to launch various subtle eavesdropping attacks including the Photon Number Splitting (PNS) attack. The decoy state protocols recently … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 4 · 31 Dec 2009 · 8,434 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordInteger Factorization: Solution via Algorithm for Constrained Discrete Logarithm ProblemBoris S. VerkhovskyProblem statement: During the last thirty years many public-key cryptographic protocols based on either the complexity of integer factorization of large semiprimes or the Discrete Logarithm Problem (DLP) have been developed. Approach: Although several factorization algorithms with sub-exponential complexity have been discovered, the recent RSA Factoring Challenge demonstrated that it was still necessary to use several thousand computers working in … …Journal of Computer Science, Vol. 5, Issue 9 · 30 Dec 2009 · 7,156 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordAccelerated Search for Gaussian Generator Based on Triple Prime IntegersBoris S. Verkhovsky, Md Shiblee SadikProblem statement: Modern cryptographic algorithms are based on complexity of two problems: Integer factorization of real integers and a Discrete Logarithm Problem (DLP). Approach: The latter problem is even more complicated in the domain of complex integers, where Public Key Cryptosystems (PKC) had an advantage over analogous encryption-decryption protocols in arithmetic of real integers modulo p: The former PKC have … …Journal of Computer Science, Vol. 5, Issue 9 · 30 Sep 2009 · 6,517 accessesView PDFCite