3328 search results - page 33 / 666 » On Plateaued Functions and Their Constructions |
ASIACRYPT
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
ISOLA
2010
Springer
13 years 6 months ago
2010
Springer
In the Taverna workflow design and enactment tool, users often find it difficult to both manually discover a service or workflow fragment that executes a desired operation on a pie...
STOC
2005
ACM
14 years 9 months ago
2005
ACM
We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitmen...
IMA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. An increasingly important design constraint for software running on ubiquitous computing devices is security, particularly against physical methods such as side-channel a...
TCAD
2002
13 years 8 months ago
2002
This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Gate Matrix Layout Problem (GMLP). The GMLP happens in very large scale integration (VLSI) desi...