66 search results - page 3 / 14 » Secure Linear Algebra Using Linearly Recurrent Sequences |
ASIACRYPT
2001
Springer
14 years 6 days ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
CTRSA
2009
Springer
14 years 3 months ago
2009
Springer
CTC is a toy cipher designed in order to assess the strength of algebraic attacks. While the structure of CTC is deliberately weak with respect to algebraic attacks, it was claimed...
MP
2010
13 years 3 months ago
2010
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
SACRYPT
1999
Springer
14 years 24 days ago
1999
Springer
In this paper, we introduce a new approach to the generation of binary sequences by applying trace functions to elliptic curves over GF 2m . We call these sequences elliptic curve...
FSE
2004
Springer
14 years 1 months ago
2004
Springer
We present a realization of an LFSM that utilizes an LFSR. This is based on a well-known fact from linear algebra. This structure is used to show that a previous attempt at using a...