Sciweavers

6568 search results - page 139 / 1314
» Reducing the Complexity of Reductions
Sort
View
CTRSA
2010
Springer
189views Cryptology» more  CTRSA 2010»
16 years 1 months ago
Linear Cryptanalysis of Reduced-Round PRESENT
Abstract. PRESENT is a hardware-oriented block cipher suitable for resource constrained environment. In this paper we analyze PRESENT by the multidimensional linear cryptanalysis m...
Joo Yeon Cho
DATE
2004
IEEE
113views Hardware» more  DATE 2004»
15 years 10 months ago
Dynamic Memory Management Design Methodology for Reduced Memory Footprint in Multimedia and Wireless Network Applications
New portable consumer embedded devices must execute multimedia and wireless network applications that demand extensive memory footprint. Moreover, they must heavily rely on Dynami...
David Atienza, Stylianos Mamagkakis, Francky Catth...
CORR
2010
Springer
111views Education» more  CORR 2010»
15 years 6 months ago
Reducing the Number of Annotations in a Verification-oriented Imperative Language
Abstract. Automated software verification is a very active field of research which has made enormous progress both in theoretical and practical aspects. Recently, an important amou...
Guido de Caso, Diego Garbervetsky, Daniel Gor&iacu...
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
15 years 10 months ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali
DDECS
2009
IEEE
202views Hardware» more  DDECS 2009»
16 years 1 months ago
Asynchronous two-level logic of reduced cost
— We propose a novel synthesis method of a dual-rail asynchronous two-level logic of reduced cost. It is based on a model that operates under so called modified weak constraints....
Igor Lemberski, Petr Fiser