We present a protocol for two parties to generate an RSA key in a distributed manner. At the end of the protocol the public key: a modulus N = PQ, and an encryption exponent e are known to both parties. Individually, neither party obtains information about the decryption key d and the prime factors of N : P and Q. However, d is shared among the parties so that threshold decryption is possible.

Key establishment in sensor networks is a challenging problem because asymmetric key cryptosystems are unsuitable for use in resource constrained sensor nodes, and also because the nodes could be physically compromised by an adversary. We present three new mechanisms for key establishment using the framework of pre-distributing a random set of keys to each node. First, in the q-composite keys s...

In this paper, we present a new lattice-based public-key cryptosystem mixed with a knapsack, which has reasonable key size and quick encryption and decryption. The module strategy in our cryptosystem can also be used to construct a framework for some GGH-type cryptosystems to improve their security.

Braid cryptosystem was proposed in CRYPTO 2000 as an alternate public-key cryptosystem. The security of this system is based upon the conjugacy problem in braid groups. Since then, there have been several attempts to break the braid cryptosystem by solving the conjugacy problem in braid groups. In this paper, we first survey all the major attacks on the braid cryptosystem and conclude that the ...

We present a protocol for two parties to generate an RSA key in a distributed manner. At the end of the protocol the public key: a modulus N = PQ, and an encryption exponent e are known to both parties. Individually, neither party obtains information about the decryption key d and the prime factors of N : P and Q. However, d is shared among the parties so that threshold decryption is possible.

Both systems are public key systems, meaning that there is a secret key used for decryption and a publicly available key used for encrypting. In theory everyone can send you an encrypted message by using the public key (if they know where to obtain it), but you’re the only one who can decrypt the message. Of course these systems rely on the difficulties in obtaining the private key, when knowin...

We present a protocol for two parties to generate an RSA key in a distributed manner. At the end of the protocol the public key: a modulus N = PQ, and an encryption exponent e are known to both parties. Individually, neither party obtains information about the decryption key d and the prime factors of N : P and Q. However, d is shared among the parties so that threshold decryption is possible.

A new approach for identifying a friend aircrafts from foe (IFF) using public-key cryptosystem is introduced. Two schemes of public-key cryptosystem namely: RSA and knapsack public-keys are considered, which provide higher security than conventional identification methods. The practical aspects of using such systems for aircraft identification purposes are discussed. Computer simulation example...

A new approach for identifying a friend aircrafts from foe (IFF) using public-key cryptosystem is introduced. Two schemes of public-key cryptosystem namely: RSA and knapsack public-keys are considered, which provide higher security than conventional identification methods. The practical aspects of using such systems for aircraft identification purposes are discussed. Computer simulation example...

A new approach for identifying a friend aircrafts from foe (IFF) using public-key cryptosystem is introduced. Two schemes of public-key cryptosystem namely: RSA and knapsack public-keys are considered, which provide higher security than conventional identification methods. The practical aspects of using such systems for aircraft identification purposes are discussed. Computer simulation example...