Name
Abstract | ||
|---|---|---|
In this paper, we show that feedforward functions defined by de Bruijn sequences, called de Bruijn functions, satisfy some
basic cryptographic requirements. It is shown how the family of de Bruijn feedforward functions could be parametrized by a
key space. De Bruijn feedforward functions are balanced and complete. A lower bound of the degree of de Bruijn functions is
given. A certain correlational weakness of a class of de Bruijn functions is analyzed and an algebraic method to meliorate
the weakness is also given and it will not cause any substantial drawbacks withregard to other requirements. The lower bound
given in this paper is by no means discouraging, yet there is hope for substantial improvements. So, improving the given lower
bound is proposed as an open problem at the end of this paper.
|
Year | Venue | Keywords |
|---|---|---|
1989 | EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology | de brujin sequence,feedforward function,lower bound,satisfiability,de bruijn sequence |
Field | DocType | ISBN |
Key space,Discrete mathematics,Combinatorics,BEST theorem,Open problem,Upper and lower bounds,Computer science,De Bruijn graph,De Bruijn sequence,De Bruijn index,Feed forward | Conference | 3-540-53433-4 |
Citations | PageRank | References |
1 | 0.34 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zong-duo Dai | 1 | 203 | 25.53 |
| K. C. Zeng | 2 | 1 | 0.34 |