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

113 results for “public-key”
Set a search alert
Research ArticleOpen accessIn the keywordsInteger 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 accessIn the keywordsAccelerated 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
Research ArticleOpen accessIn the keywordsSecure Mobile Trade AgentMusbah M. Aqel, Sattar J. Aboud, Mohammed A. AL-FayoumiE-commerce on the internet has the ability to produce millions of transactions and a great number of merchants whose supply merchandise over the internet. As a result, it is difficult for entities to roam over every site on the internet and choose the best merchandise to trade. So, in this paper we introduced a mobile trade agent that visit the … …Journal of Computer Science, Vol. 3, Issue 5 · 31 May 2007 · 6,766 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Holistic Approach to Security, Availability and Reliability in Fog ComputingAbdulrahman Alshehri, Hazzaa Alshareef, Samah Alhazmi et al.Abdulkareem, K. H., Mohammed, M. A., Gunasekaran, S. S., Al-Mhiqani, M. N., Mutlag, A. A., Mostafa, S. A., Ali, N. S., & Ibrahim, D. A. (2019). A Review of Fog Computing and Machine Learning: Concepts, Applications, Challenges, and Open Issues. IEEE Access, 7, 153123–153140. https://doi.org/10.1109/access.2019.2947542 Alrawais, A., Alhothaily, A., Hu, C., & Cheng, X. (2017). Fog Computing for the Internet … …Journal of Computer Science, Vol. 20, Issue 6 · 20 Mar 2024 · 6,372 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA NOVEL APPROACH FOR INFORMATION SECURITY IN AD HOC NETWORKS THROUGH SECURE KEY MANAGEMENTS. Suma Christal Mary, M. PallikondaRajasekaran, Y. ChrisbinJeevaAd hoc networks provide flexible and adaptive networks with no fixed infrastructure and dynamic topology. Owe to the vulnerability nature of ad hoc network, there are lots of security threats that diminish the development of ad hoc networks. Therefore, to provide security for information of users and to preserve their privacy, it becomes mandatory to use cryptographic techniques to set … …Journal of Computer Science, Vol. 9, Issue 11 · 2 Oct 2013 · 6,690 accessesView PDFCite
Research ArticleOpen accessIn the keywordsAN EFFICIENT AUTONOMOUS KEY MANAGEMENT WITH REDUCED COMMUNICATION/COMPUTATION COSTS IN MOBILE AD HOC NETWORKM. Devi, S. Chenthur PandianA primary concern in Mobile Ad Hoc Networks (MANETs) is security. Secret sharing is an effective way to distribute a secret among n parties, where each party holds one piece of the secret. A number of key management schemes have been proposed for MANETs. However the secret sharing to control key hierarchy needs larger message transmission costs in many techniques. … …Journal of Computer Science, Vol. 9, Issue 10 · 5 Sep 2013 · 6,778 accessesView PDFCite
Research ArticleOpen accessIn the keywordsComparative Study of Performance in Cryptography Algorithms (Blowfish and Skipjack)Ali Ahmad Milad, Hjh Zaiton Muda, Zul Azri Bin Muhamad Noh, Mustafa Almahdi AlgaetProblem statement: The main goal guiding the design of any encryption algorithm needs to be secured against unauthorized attacks. For all applied applications, performance and the cost of implementations are also important concerns. A data encryption algorithm would not be of much use if it is secure enough but slow in performance because it is a common repetition to embed … …Journal of Computer Science, Vol. 8, Issue 7 · 7 Jul 2012 · 8,018 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Secure Simple Authenticated Key Exchange Algorithm based Authentication for Social NetworkP. Venkateswari, T. PurusothamanProblem statement: This study describes about a robust and secured authentication procedure that can be adapted in a private forum within a Social Network Site (SNS) to update its user’s profile. Approach: The robustness is achieved through combining proven security measures combined with usability aspects. The study demonstrates acceptance of such robustness particularly in a SNS to update user’s profile. … …Journal of Computer Science, Vol. 7, Issue 8 · 14 Jul 2011 · 6,594 accessesView PDFCite
Research ArticleOpen accessIn the keywordsAuthenticated Broadcast in Heterogeneous Wireless Sensor Networks using Chinese Remainder Theorem AlgorithmKalyani Palanisamy, ChellappanProblem statement: The security in Wireless Sensor Networks (WSN) is a critical issue due to the inherent limitations of computational capacity, storage capacity and power usage. Key management only makes sure the communicating nodes possess the necessary keys, at the same time protecting the confidentiality, integrity and authenticity of the communicated data. Approach: Proposed a RSA-CRT methodology for authenticated broadcast … …Journal of Computer Science, Vol. 7, Issue 6 · 14 Jun 2011 · 6,413 accessesView PDFCite
Research ArticleOpen accessIn the keywordsGroup Re-keying Protocol Based on Modular Polynomial Arithmetic Over Galois Field GF(2n)Sundaram Sudha, Azman Samsudin, Mohammad Ahmad AliaProblem statement: In this study we propose a group re-keying protocol based on modular polynomial arithmetic over Galois Field GF(2n). Common secure group communications requires encryption/decryption for group re-keying process, especially when a group member is leaving the group. Approach: This study proposes secret keys multiplication protocol based on modular polynomial arithmetic (SKMP), which eliminates the need for the encryption/decryption … …American Journal of Applied Sciences, Vol. 6, Issue 9 · 30 Sep 2009 · 7,165 accessesView PDFCite