#### Filter Results:

#### Publication Year

2006

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We investigate the security of n-bit to m-bit vectorial Boolean functions in stream ciphers. Such stream ciphers have higher through-put than those using single-bit output Boolean functions. However, as shown by Zhang and Chan at Crypto 2000, linear approximations based on composing the vector output with any Boolean functions have higher bias than those… (More)

Multiplex is a set of graphs on the same vertex set, i.e. It is a generalized graph to model multiple relationships with parallel edges between vertices. This paper is a literature review of existing communities detection algorithms for multiplex and a comparative analysis of them.

We investigate the security of n-bit to m-bit vectorial Boolean functions in stream ciphers. Such stream ciphers have higher throughput than those using single-bit output Boolean functions. However , as shown by Zhang and Chan at Crypto 2000, linear approximations based on composing the vector output with any Boolean functions have higher bias than those… (More)

Random networks generators like Erd˝ os-Rényi, Watts-Strogatz and Barabási-Albert models are used as models to study real-world networks. Let G 1 (V, E 1) and G 2 (V, E 2) be two such networks on the same vertex set V. This paper studies the degree distribution and clustering coefficient of the resultant networks,

In this paper, we present several new attacks on multiple encryption block ciphers based on the meet-in-the-middle attack. In the first attack (GDD-MTM), we guess a certain number of secret key bits and apply the meet-in-the-middle attack on multiple ciphertexts. The second attack (TMTO-MTM) is derived from applying the time-memory trade-off attack to the… (More)

Mark-and-Recapture is a methodology from Population Biology to estimate the number of a species without counting every individual. This is done by multiple samplings of the species using traps and discounting the instances that were caught repeated. In this paper we show that this methodology is applicable for citation analysis as it is also not feasible to… (More)

The vertices of an interval graph represent intervals over a real line where overlapping intervals denote that their corresponding vertices are adjacent. This implies that the vertices are measurable by a metric and there exists a linear structure in the system. The generalization is an embedding of a graph onto a multi-dimensional Euclidean space and it… (More)

Let $G^1(V,E_1)$ and $G^2(V,E_2)$ be two networks on the same vertex set $V$ and consider the union of edges $G(V, E_1 \cup E_2)$. This paper studies the stability of the Degree, Betweenness and Eigenvector Centrality of the resultant network, $G(V, E_1 \cup E_2)$. Specifically assume $v^1_{max}$ and $v^c_{max}$ are the highest centrality vertices of… (More)

We investigate three side channel attacks on ABSG, a variant of irregularly decimated generators (IDG). The three attacks are timing analysis, phase-shift fault analysis and bit-flipping fault analysis. We also modify the attacks to non side-channel cryptanalyses, but on the assumption that the key/IV mixing is not well designed. This paper hopes to provide… (More)

In the literature, several encryption modes of operation based on cipher block chaining (CBC) has been proven to be secure under non-adaptive chosen plaintext attack (CPA-1) in the left-or-right (LOR) or find-then-guess (FTG) security models. However, it was shown by Joux et. al. at Crypto 2002 that if we allow the adversary to perform an adaptive chosen… (More)

- ‹
- 1
- ›