A public key cryptosystem is an asymmetric cryptosystem where the key consist of a public key and a private key. As the public key is public (known to all), can be used to encrypt the messages. The private key, kept as secret, can be used to decrypt the messages by the owner. We describe a new public key cryptosystem based on logarithmic approach. PCLA with its simplicity, it's very easier to create keys and can be use securely with low memory requirements. PCLA encryption and decryption use a mixing system suggested by logarithmic approach combined with a clustering principle based on elementary mathematical theory. The security of the PCLA cryptosystem comes from the interaction of the logarithmic mixing system with the independence of relatively prime integer's p and q.
In this modern era of digital communication even a trivial task needs to be performed over internet which is not secure. Many cryptographic algorithms existed to provide security which facilitates secure communication through internet. As these algorithms need a secret session key, it is required to interchange this key in a secure way. In two-party communication, two clients initially share a low random (entropy) password through a secure channel to establish a secret session key. But this paradigm necessitates high maintenance of passwords, since each communicating pair requires separate passwords to establish a secure session key. In three-party communication network, each communication party shares a password with the trusted third-party (server) to exchange a secret session key. The beauty of this setting is that, even a server does not know the session key. The Password Authenticated Encrypted Key Exchange (PA-EKE) protocols have attracted a lot of curiosity to authors to propose various two-party and three-party PA-EKE protocols. Security flaws in various protocols proposed by Chang-Chang, Yoon-Yoo, PSRJ and Raj et al. inspired to design a robust, computationally efficient and highly secure protocol. This paper is an attempt to propose a secure and novel Password Authenticated 3P-EKE protocol using XOR operations and analogous (parallel) message transmission. The proposed protocol is easy to design and more secured against all types of attacks like password guessing, replay, pre-play, server spoofing etc. which made this protocol special.
Abstract-This paper endeavors to present a novel framework for the generic structure of a verifier-based password authenticated Three-Party Encrypted Key Exchange (3P-EKE) protocol which yields more efficient protocol than the ones knew before. A previous framework presented by Archana and Premchand is more secured against all types of attacks like password guessing, replay, pre-play, man-in-the-middle attack etc. But unfortunately, this protocol does not solve the problem of a server compromise. These proofs help as inspiration to search for another framework. The framework we offer produces more efficient 3P-EKE protocol, and, in addition, delivers perceptive clarification about the existing attacks that do not solve in the previous framework. Moreover, it allows direct change from a class of verge private-key encryption to a hybrid (symmetric & Asymmetric) one without significant overhead.
Twitter is a social networking site in which the data to be processed is in rich amounts and which can be structured, semi-structured and unstructured data streams. Opinion mining over the Twitter offers organizations a fast and effective way to monitor the feelings of public towards their services. It focuses on predicting the polarity of words and then classifies them into positive and negative feelings with the aim of identifying attitude and opinions that are expressed in any form or language. Bian et al. (2014) explains how the Map -Reduce paradigm can be applied to existing Naïve Bayes algorithm to handle a large number of tweets. All these approaches say about the real-world data sets at its accuracy level by using Hadoop File System. This paper analyses all the above methods comparatively.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.