As an important method to analyze the security states of computer network, the generation of network attack graph is a hot topic in this domain. After analyzing network vulnerabilities, linking relation between devices and the characteristic of attack, the model of network security states is built, and the generating algorithm of attack graph is implemented. The experiment validates the prototy...

In this work we present a quantum key distribution protocol using continuous-variable nonGaussian states, homodyne detection and post-selection. The employed signal states are the Photon Added then Subtracted Coherent States (PASCS) in which one photon is added and subsequently one photon is subtracted. We analyze the performance of our protocol, compared to a coherent state based protocol, for...

The Advanced Encryption Standard (AES) is a 128-bit block cipher with a user key of 128, 192 or 256 bits, released by NIST in 2001 as the next-generation data encryption standard for use in the USA. It was adopted as an ISO international standard in 2005. Impossible differential cryptanalysis and the boomerang attack are powerful variants of differential cryptanalysis for analysing the security...

In the biclique attack, a shorter biclique usually results in less data complexity, but at the expense of more computational complexity. The early abort technique can be used in partial matching part of the biclique attack in order to slightly reduce the computations. In this paper, we make use of this technique, but instead of slight improvement in the computational complexity, we keep the amo...

In many newly emerging network there is a need to provide secure transmission within the network.MANET is one such network which requires secure group communication.The key concept in security is key management.In the existing key management systems third party is fully trusted for key generation.Hence the trustworthiness of third party is more important to provide secure communication.Here we ...

In this report we present a new fault attack that applies to some implementations of elliptic curve scalar multiplication (ECSM). We consider the fault model with 'precise control of time', 'loose control of fault location' and 'random number of faulty bits'. We show that in this fault model the secret key can be revealed with polynomial time complexity and linear number of faults. In addition,...

Deterministic signature schemes are becoming more popular, as illustrated by the deterministic variant of ECDSA and the popular EdDSA scheme, since eliminating the need for high-quality randomness might have some advantages in certain use-cases. In this paper we outline a range of differential fault attacks and a di erential power analysis attack against such deterministic schemes. This shows, ...

We propose a key generation method for RSA moduli which allows the cost of the public operations (encryption/verifying) and the private operations (decryption/signing) to be balanced according to the application requirements. Our method is a generalisation of using small public exponents and small Chinese remainder (CRT) private exponents. Our results are most relevant in the case where the cos...

We present a very simple probabilistic, passive attack against the protocols HB and HB. Our attack presents some interesting features: it requires less captured transcripts of protocol executions when compared to previous results; It makes possible to trade the amount of required transcripts for computational complexity; the value of noise used in the protocols HB and HB need not be known.