Results 1  10
of
4,069
Exploiting Multiples of the Connection Polynomial in WordOriented Stream Ciphers
"... SOBERlike stream ciphers and SSClike stream ciphers are wordoriented stream ciphers that use a linear feedback shift register (LFSR) and a nonlinear lter. This paper describes examples of attacks on such ciphers, where the attacks rely on exploiting linear relationships corresponding to multiple ..."
Abstract
 Add to MetaCart
to multiples of the connection polynomial that de ne the LFSR. The rst example is an attack against the LFSR component of SSCII. This attack exploitsapower of the bitwise connection polynomial. The second example is an attack on a dummy SOBERlike cipher which exploits multiples of the word
Exploiting Multiples of the Connection Polynomial in WordOriented Stream Ciphers
 Advances in Cryptology  ASIACRYPT 2000, Lecture Notes in Computer Science
, 2000
"... This paper describes some attacks on wordoriented stream ciphers that use a linear feedback shift register #LFSR# and a nonlinear #lter. These attacks rely on exploiting linear relationships corresponding to multiples of the connection polynomial that de#ne the LFSR. Keywords: stream ciphers, ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
This paper describes some attacks on wordoriented stream ciphers that use a linear feedback shift register #LFSR# and a nonlinear #lter. These attacks rely on exploiting linear relationships corresponding to multiples of the connection polynomial that de#ne the LFSR. Keywords: stream ciphers
Matrix Polynomials
, 1982
"... Abstract. The pseudospectra of a matrix polynomial P (λ) are sets of complex numbers that are eigenvalues of matrix polynomials which are near to P (λ), i.e., their coefficients are within some fixed magnitude of the coefficients of P (λ). Pseudospectra provide important insights into the sensitivit ..."
Abstract

Cited by 304 (9 self)
 Add to MetaCart
Abstract. The pseudospectra of a matrix polynomial P (λ) are sets of complex numbers that are eigenvalues of matrix polynomials which are near to P (λ), i.e., their coefficients are within some fixed magnitude of the coefficients of P (λ). Pseudospectra provide important insights
Approximation Algorithms for Connected Dominating Sets
 Algorithmica
, 1996
"... The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size, whe ..."
Abstract

Cited by 366 (9 self)
 Add to MetaCart
, where the graph induced by vertices in the dominating set is required to be connected as well. This problem arises in network testing, as well as in wireless communication. Two polynomial time algorithms that achieve approximation factors of O(H (\Delta)) are presented, where \Delta is the maximum
A general approximation technique for constrained forest problems
 SIAM J. COMPUT.
, 1995
"... We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles, or paths satisfying certain requirements. In particular, many basic combinatorial optimization proble ..."
Abstract

Cited by 414 (21 self)
 Add to MetaCart
of these problems. For instance, we obtain a 2approximation algorithm for the minimumweight perfect matching problem under the triangle inequality. Our running time of O(n log n) time compares favorably with the best strongly polynomial exact algorithms running in O(n 3) time for dense graphs. A similar result
Complexity of finding embeddings in a ktree
 SIAM JOURNAL OF DISCRETE MATHEMATICS
, 1987
"... A ktree is a graph that can be reduced to the kcomplete graph by a sequence of removals of a degree k vertex with completely connected neighbors. We address the problem of determining whether a graph is a partial graph of a ktree. This problem is motivated by the existence of polynomial time al ..."
Abstract

Cited by 386 (1 self)
 Add to MetaCart
A ktree is a graph that can be reduced to the kcomplete graph by a sequence of removals of a degree k vertex with completely connected neighbors. We address the problem of determining whether a graph is a partial graph of a ktree. This problem is motivated by the existence of polynomial time
The benefits of coding over routing in a randomized setting
 In Proceedings of 2003 IEEE International Symposium on Information Theory
, 2003
"... Abstract — We present a novel randomized coding approach for robust, distributed transmission and compression of information in networks. We give a lower bound on the success probability of a random network code, based on the form of transfer matrix determinant polynomials, that is tighter than the ..."
Abstract

Cited by 361 (44 self)
 Add to MetaCart
Abstract — We present a novel randomized coding approach for robust, distributed transmission and compression of information in networks. We give a lower bound on the success probability of a random network code, based on the form of transfer matrix determinant polynomials, that is tighter than
Cones of matrices and setfunctions and 01 optimization
 SIAM JOURNAL ON OPTIMIZATION
, 1991
"... It has been recognized recently that to represent a polyhedron as the projection of a higher dimensional, but simpler, polyhedron, is a powerful tool in polyhedral combinatorics. We develop a general method to construct higherdimensional polyhedra (or, in some cases, convex sets) whose projection a ..."
Abstract

Cited by 347 (7 self)
 Add to MetaCart
that the stable set polytope is the projection of a polytope with a polynomial number of facets. We also discuss an extension of the method, which establishes a connection with certain submodular functions and the Möbius function of a lattice.
A Study of CNC 7 [n] Carbon Nanocone by MEccentric Connectivity Polynomial
, 2013
"... Abstract: The Eccentric Connectivity ..."
Results 1  10
of
4,069