107 search results - page 7 / 22 » Some Applications of Bounds for Designs to the Cryptography |
WDAG
2009
Springer
14 years 1 months ago
2009
Springer
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
SPAA
2004
ACM
14 years 4 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
EUROCRYPT
2007
Springer
14 years 26 days ago
2007
Springer
Feistel Network, consisting of a repeated application of the Feistel Transform, gives a very convenient and popular method for designing “cryptographically strong” permutations...
ITCC
2005
IEEE
14 years 8 days ago
2005
IEEE
As a general design criterion, a symmetric key cipher should not be closed under functional composition due to the implications on the security of the cipher. However, there are s...
ICISC
2000
13 years 8 months ago
2000
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...