107 search results - page 6 / 22 » Some Applications of Bounds for Designs to the Cryptography |
PKC
2005
Springer
14 years 5 days ago
2005
Springer
In typical RSA, it is impossible to create a key pair (e, d) such that both are simultaneously much shorter than φ(N). This is because if d is selected first, then e will be of t...
NIPS
2007
13 years 8 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
EUROCRYPT
2003
Springer
13 years 12 months ago
2003
Springer
ded abstract of this paper appears in Advances in Cryptology – EUROCRYPT ’03, Lecture Notes in Computer Science Vol. 2656, E. Biham ed., Springer-Verlag, 2003. This is the full...
ISSTA
1996
ACM
13 years 11 months ago
1996
ACM
We illustrate the application of Nitpick, a specification checker, to the design of a style mechanism for a word processor. The design is cast, along with some expected properties...
FOCS
2006
IEEE
14 years 23 days ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...