Clock-controlled shift registers and generalized Geffe key-stream generator

Autor: Kholosha, A., Rangan, C.P., Ding, C.

Publikováno v: Lecture Notes in Computer Science ISBN: 9783540430100
INDOCRYPT
Progress in Cryptology--Indocrypt 2001 (Chennai, India, December 16-20, 2001), 287-296
STARTPAGE=287;ENDPAGE=296;TITLE=Progress in Cryptology--Indocrypt 2001 (Chennai, India, December 16-20, 2001)

In this paper we devise a generalization of the Geffe generator that combines more than three periodic inputs over GF(q). In particular, clock-controlled shift registers are suggested as inputs. The period and the linear complexity of the generated k

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36536dff2c872c8511f4a51815372246
https://doi.org/10.1007/3-540-45311-3_27

On the power of computational secret sharing

Autor: Vinod, V., Narayanan, A., Srinathan, K., Rangan, C.P., Kim, K.

Publikováno v: IndraStra Global.

Secret sharing is a very important primitive in cryptography and distributed computing. In this work, we consider computational secret sharing (CSS) which provably allows a smaller share size (and hence greater efficiency) than its information-theore

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=issn23813652::48e982e54bf60be26ba757d12b2f3be8
https://igi.indrastra.com/items/show/75261

Upper bounds for MaxSat : Further improved

Autor: Bansal, N., Raman, V., Aggarwal, A., Rangan, C.P.

Publikováno v: Algorithms and Computation (10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999. Proceedings), 247-258
STARTPAGE=247;ENDPAGE=258;TITLE=Algorithms and Computation (10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999. Proceedings)
Algorithms and Computation ISBN: 9783540669166
ISAAC

Given a boolean CNF formula F of length \F\ (sum of the number of variables in each clause) with m clauses on n variables, we prove the following results. --- The MAXSAT problem, which asks for an assignment satisfying the maximum number of clauses o

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5dd078a6424d2ad8679221517fd11a48
https://research.tue.nl/nl/publications/88bb6ce5-f97f-40ea-9801-7d7d2eda3bde

Partial and perfect path covers of cographs

Autor: Kirkpatrick, D.G., Reddy, K.M., Rangan, C.P., Srinivasan, A.

Publikováno v: IndraStra Global.

A set ? of disjoint paths in a graph G is called a (complete) path cover of G if every vertex of G belongs to one of the paths in ?. A path cover of any subgraph of G is called a partial path cover of G. For fixed k > 0, a k-blanket of graph G is a p

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=issn23813652::cfe24569715436bf8617dfc7169ec903
https://igi.indrastra.com/items/show/72499

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.