Sciweavers

171 search results - page 4 / 35
» On Chebyshev Polynomials of Matrices
Sort
View
CORR
2004
Springer
107views Education» more  CORR 2004»
13 years 7 months ago
Security of public key cryptosystems based on Chebyshev Polynomials
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...
Pina Bergamo, Paolo D'Arco, Alfredo De Santis, Lju...
COMBINATORICS
2002
80views more  COMBINATORICS 2002»
13 years 7 months ago
321-Polygon-Avoiding Permutations and Chebyshev Polynomials
A 321-k-gon-avoiding permutation avoids 321 and the following four patterns: k(k + 2)(k + 3)
Toufik Mansour, Zvezdelina Stankova
ARTCOM
2009
IEEE
14 years 2 months ago
Public Key Cryptosystems Based on Chaotic-Chebyshev Polynomials
Gnanajeyaraman Rajaram, K. Ramar, Prasadh K. K. Pi...
DM
1999
55views more  DM 1999»
13 years 7 months ago
Forbidden subsequences and Chebyshev polynomials
Timothy Chow, Julian West
TCS
2008
13 years 7 months ago
Computations with quasiseparable polynomials and matrices
In this paper we survey several recent results that highlight an interplay between a relatively new class of quasiseparable matrices and polynomials. Quasiseparable matrices gener...
Tom Bella, Yuli Eidelman, Israel Gohberg, Vadim Ol...