Complexity Theoretic Aspects of some Cryptographic Functions (2003)
Cached
Download Links
- [intern.lmi.ruhr-uni-bochum.de]
- [homepages.cwi.nl]
- DBLP
Other Repositories/Bibliography
by
Eike Kiltz
,
Hans Ulrich Simon
| Venue: | Proceedings of the 9th International Conference on Computing and Combinatorics COCOON 2003, volume 2697 of Lecture Notes in Computer Science |
| Citations: | 1 - 1 self |
BibTeX
@INPROCEEDINGS{Kiltz03complexitytheoretic,
author = {Eike Kiltz and Hans Ulrich Simon},
title = {Complexity Theoretic Aspects of some Cryptographic Functions},
booktitle = {Proceedings of the 9th International Conference on Computing and Combinatorics COCOON 2003, volume 2697 of Lecture Notes in Computer Science},
year = {2003},
pages = {294--303},
publisher = {SpringerVerlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this work, we are interested in non-trivial upper bounds on the spectral norm of binary matrices M from . It is known that the distributed Boolean function represented by M is hard to compute in various restricted models of computation if the spectral norm is bounded from above by N , where # > 0 denotes a fixed constant.
