1254 search results - page 18 / 251 » Making Hard Problems Harder |
CTRSA
2010
Springer
13 years 11 months ago
2010
Springer
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and rece...
FMCAD
2004
Springer
14 years 1 months ago
2004
Springer
Late changes in silicon design (ECO) is a common although undesired practice. The need for ECO exists even in high-level design flows since bugs may occur in the specifications, ...
APAL
2008
13 years 7 months ago
2008
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
An elliptic curve random number generator (ECRNG) has been approved in a NIST standards and proposed for ANSI and SECG draft standards. This paper proves that, if three conjecture...
TASE
2008
IEEE
13 years 7 months ago
2008
IEEE
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...