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...
In this paper we analyze the block cipher SAFER K. First, we show a weakness in the key schedule, that has the effect that for almost every key there exists on the average three an...
In this paper, we investigate combinatorialproperties and constructions of two recent topics of cryptographic interest, namely frameproof codes for digital ngerprinting, and trace...
The democratization of ubiquitous computing (access data anywhere, anytime, anyhow), the increasing connection of corporate databases to the Internet and the today's natural ...
Abstract. The widespread deployment of inexpensive communications technology, computational resources in the networking infrastructure, and network-enabled end devices poses an int...
Todd D. Hodes, Steven E. Czerwinski, Ben Y. Zhao, ...