A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Ravikumar, K.
- Multi-Party Electronic Payment System Using ECCMA Algorithm
Authors
1 Dept. of Computer Science, Karpagam University, Coimbatore, IN
2 Dept. of Computer Science, Tamil University, Thanjavur-613010, Tamil Nadu, IN
Source
Networking and Communication Engineering, Vol 6, No 8 (2014), Pagination: 328-334Abstract
Security in digital communications nowadays depends on cryptography. Multiparty Key Access depends on algorithms for generating asymmetric keys. The present algorithmic rule in use is MKA that uses mathematical properties of prime numbers and therefore the quality of resolving giant numbers to come up with secure asymmetric keys. A more modern algorithmic rule that might be used is Elliptic Curve Cryptography (ECC). Elliptic Curves have mathematical properties in which specified uneven keys is generated which is stronger than those created by Existing strategies. To investigate the utilization of ECC for MKA, a basic ECC generator is used and it will generate live keys and coding durations. The comparative key strength of ECC and Existing strategies is taken into thought; ECC is orders of magnitude quicker than Existing strategies for a similar security. The problems preventing the adoption of ECC using MKA in Cryptography area for raising security unit mentioned. The properties rights of ECC are utilized in MKA, the biggest obstacle to ECC adoption are substitution the present MKA infrastructure that uses Existing strategies. It is expected that ECC in MKA can become customary by 2020.Keywords
Cryptography, Decryption, Encryption, Elliptic Curve, Multi-Party.
- Performance Analysis for Electronic Payment Systems
Authors
1 Tamil University, Thanjavur, IN
2 Karpagam University, Coimbatore, IN
3 AM Jain College, Chennai, IN
Source
Networking and Communication Engineering, Vol 4, No 13 (2012), Pagination: 800-802Abstract
In this paper, thus the research analysis, design and implementation phase has been described for our research. It is proposed framework architecture for the Secure Multiparty Electronic Payments in mobile computing in order to support self-protection in AmI scenarios. The architecture of our framework is device-and platform independent and focuses on the use of auctions protocols for electronic payments policies. The top priority was the security of the auctions. All secret information that is exchanged between the auctions host and the peers is encrypted and protected against illegitimate modifications. it will extend the modularity of the proposed framework in order to allow individual utility functions and a replaceable module for determining the winning policy. Further, the integration of our framework into the refinement process of semantic high-level policies is in progress.Keywords
Multi-party Security, Mobile Computing, Cryptography, Negotiation.- E Market Place Security Using Elliptic Curve Distributed Key
Authors
1 Dept. of Computer Science, Tamil University, Thanjavur, IN
2 CIT, Coimbatore, IN
3 Karpagam University, IN
4 Tamil University, IN
Source
Networking and Communication Engineering, Vol 3, No 13 (2011), Pagination: 830-832Abstract
Aiming to develop an e-market, need to consider not only technological, but also business issues that might affect their acceptance and profitability. By describing an example of an e-market application, this paper discusses these issues and shows that although technology may provide various different solutions for the development of an e-market, it cannot on its own lead to an e-market’s success. During the last decade e-commerce has quickly evolved through a succession of business models. The commercially operational business sites in eleven categories: e-shop, e-auction, e-procurement, e-mall, third party marketplace, virtual communities, value chain service provider, value chain integrator, collaboration platform, information brokerage and trust. However, that the Internet economy has divided the overall market space into three broader structures: Portals, Market Makers, and Product Service providers. A portal engages primarily in building a community of users seeking information about products and services. A market maker plays a similar role with that of a portal in building a community of buyers, customers. A community of suppliers of products and services. However, market makers differ from portals in that they provide, handle and facilitate the business transaction that takes place between the buyer and the supplier. Last but not least, the product, service providers are dealing directly with their customers when it ultimately comes to the business transaction. These three structures incorporate various business models or different definitions. For example, a market maker is similar to an e-mall, a third party marketplace, an e-marketplace or an e-market. For reasons of clarity, in this paper, define our application by using the term “e-market”. E-markets have evolved and become important elements in the Internet-age economy. The main functionality of an electronic market is to match seller offerings with buyer preferences.Keywords
E-Market, ECC, Distributed Key.- Algorithm for Cryptanalysis with Application to Data Encryption Standard
Authors
Source
Networking and Communication Engineering, Vol 1, No 6 (2009), Pagination: 240-244Abstract
A random search through a finite but large key space is not usually an acceptable cryptanalysis approach. The focus of this work is on the use of a genetic algorithm (GA) to conduct a directed search in a key space. The structure of Lucifer was significantly altered and since the design rationale was never made public and the secret key size was reduced from 128-bit to 56-bits this initially resulted in controversy, and some distrust among the public. In this paper, a new method has been developed for the first time to break DES like examples. These examples include both DES with eight rounds. The performance of the proposed method, as such, is considerably faster than exhaustive search and differential cryptanalysis. Therefore, it can be directly applied to a variety of DES like systems instead of the current techniques. Here, a Genetic Algorithm, GA, is proposed for the cryptanalysis is of DES like systems to find out the underlying key. The genetic algorithm approach is adopted, for obtaining the exact key by forming an initial population of keys that belong to the key subspace. In the proposed algorithms, the premature convergence could be avoided by dynamic variation of control parameters that can affect the fitness function. DES uses a 56-bit encryption key. The key size was apparently dictated by the memory and processing constraints imposed by a single-chip implementation of the algorithm for DES. The key itself is specified with 8 bytes, but one bit of each byte is used as a parity check.