quantum secret sharing where a quantum participant Alice can share a secret key with two classical participants Bobs. After analyz.Secret sharing is a procedure for splitting a message into several parts so that no subset of parts is. Quantum cryptography with secret sharing in a way that will.We show how a quantum secret sharing protocol, similar to that of Hillery, Buzek, and Berthiaume. A pr...

Quantum cryptographic methods increase security over classical methods. To date, quantum algorithms aim to distribute a secret key to be used afterwards to encrypt messages. The method described in this paper does not use an encryption key at all. An array of qubits is transmitted from the source to the destination with the message encoded in the phase of the qubit. The secrecy of the message d...

We investigate the feasibility of using Graphics Processing Units (GPUs) for cryptographic processing by exploiting the ability for GPUs to simultaneously process large quantities of pixels to offload symmetric key encryption from the main processor. We demonstrate the use of GPUs for applying the key stream when using stream ciphers. We investigate the use of GPUs for block ciphers, discuss op...

Many challenging security-related issues have been studied in wireless sensor networks to provide a demanded quality and security for deliverable data. Yet, one of these issues which are not handled is the secret key revocation. In a semi-dynamic, resource-constrained and long-living sensor network with self organization features, traditional revocation methods are not desirable and somehow imp...

Designing a protocol to exchange a secret key is one of the most fundamental subjects in cryptography. Using a random deal of cards, pairs of card players (agents) can share information-theoretically secure keys that are secret from an eavesdropper. In this paper we first introduce the notion of an Eulerian secret key exchange, in which the pairs of players sharing secret keys form an Eulerian ...

Three parties, Alice, Bob and Eve, know the sequences of ran-generated by a discrete memoryless source according to some probability distribution P XY Z. Motivated by Wyner's and Csiszz ar and KK orner's pioneering definition of, and work on, the secrecy capacity of a broadcast channel, the secret key rate of P XY Z was deened by Maurer as the maximal rate M=N at which Alice and Bob can generat...

We consider the NTRU encryption scheme as lately suggested for use, and study the connection between inverting the NTRU primitive (i.e., the one-way function over the message and the blinding information which underlies the NTRU scheme) and recovering the NTRU secret key (universal breaking). We model the inverting algorithms as black-box oracles and do not take any advantage of the internal wa...

NTRU cryptosystem has allowed designing a range of cryptographic schemes due to its flexibility and efficiency. Although NTRU cryptosystem was introduced nearly two decades ago, it has not yet received any attention like designing a secret key encryption. In this paper, we propose a secret key encryption over NTRU lattices, named as NTRUCipher. This NTRUCipher is designed using modification of ...

One frequently cited reason for the lack of wide deployment of cryptographic protocols is the (perceived) poor performance of the algorithms they employ and their impact on the rest of the system. Although high-performance dedicated cryptographic accelerator cards have been commercially available for some time, market penetration remains low. We take a different approach, seeking to exploit exi...