107 search results - page 5 / 22 » Some Applications of Bounds for Designs to the Cryptography |
EUROCRYPT
2005
Springer
14 years 7 days ago
2005
Springer
We present a new and flexible formulation of Coppersmith’s method for finding small solutions of bivariate polynomials p(x, y) over the integers. Our approach allows to maximiz...
ANTS
2010
Springer
13 years 10 months ago
2010
Springer
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
LATIN
2010
Springer
14 years 1 months ago
2010
Springer
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
AES
2004
Springer
14 years 3 days ago
2004
Springer
This paper is about the design of multivariate public key schemes, as well as block and stream ciphers, in relation to recent attacks that exploit various types of multivariate alg...
IAJIT
2006
13 years 6 months ago
2006
In this paper, a fast hardware architecture for elliptic curve cryptography computation in Galois Field GF(p) is proposed. The architecture is implemented for 160-bits, as its dat...