Distributed key generation cryptosystems has a major content called distributed key generation (DKG) protocol. This protocol allows number of participants of group to generate a set of keys such as private key and public key without determining some trusted participants. Only authorized subgroups of participants are capable to regenerate or implement the private key and the public key is an out...

Essential feature of New Generation Networks (NGN) is the availability of many new services offered by several different players. Different applications and services have their own authentication method and use different credentials, more reliable, flexible and easy-to-use methods are needed. In this paper we concern about different security vulnerabilities found in existing system and gives po...

sybil attacks pose a serious threat for wireless sensor networks (wsn) security. they can create problems in routing, voting schemes, decision making, distributed storage and sensor re-programming. in a sybil attack,the attacker masquerades as multiple sensor identities, that are actually controlled by one or a few existing attacker nodes. sybil identities are fabricated out of stolen keys, obt...

A side-channel analysis of a cryptographic algorithm generally concentrates on the encryption or decryption phases, rarely on the key generation phase. In this paper, we show that, when not properly implemented, the fast prime generation algorithm proposed by Joye and Paillier at CHES 2006 is susceptible to side-channel analysis; its main application is the generation of RSA key-pairs for embed...

A VPN establishes a secure network using the insecure media of the Internet. However, before a VPN can be established keys must be exchanged between the communicating peers. In this paper, we present the implementation details of the Arcanum key exchange protocol along with its experimental analysis. We simulated a number of active and passive attacks in order to test the robustness and efficie...

We introduce and analyze a side-channel attack on a straightforward implementation of the RSA key generation step. The attack exploits power information that allows to determine the number of the trial divisions for each prime candidate. Practical experiments are conducted, and countermeasures are proposed. For realistic parameters the success probability of our attack is in the order of 10–15 %.

Efficiency and security are the two main objectives of every elliptic curve scalar multiplication implementations. Many schemes have been proposed in order to speed up or secure its computation, usually thanks to efficient scalar representation [30,10,24], faster point operation formulae [8,25,13] or new curve shapes [2]. As an alternative to those general methods, authors have suggested to use...

This document describes how to further extend the Public Key Cryptography for Initial Authentication in Kerberos (PKINIT) extension [RFC4556] to exchange an opaque data blob which a KDC can validate to ensure that the client is currently in possession of the private key during a PKInit AS exchange.