Sciweavers

96 search results - page 1 / 20
» How Fast Can Higher-Order Masking Be in Software
Sort
View
CHES
2010
Springer
159views Cryptology» more  CHES 2010»
13 years 5 months ago
Provably Secure Higher-Order Masking of AES
Implementations of cryptographic algorithms are vulnerable to Side Channel Analysis (SCA). To counteract it, masking schemes are usually involved which randomize key-dependent data...
Matthieu Rivain, Emmanuel Prouff
CHES
2009
Springer
265views Cryptology» more  CHES 2009»
14 years 4 months ago
Higher-Order Masking and Shuffling for Software Implementations of Block Ciphers
Differential Power Analysis (DPA) is a powerful side channel key recovery attack that efficiently breaks block ciphers implementations. In software, two main techniques are usually...
Matthieu Rivain, Emmanuel Prouff, Julien Doget
FSEN
2009
Springer
13 years 10 months ago
Termination in Higher-Order Concurrent Calculi
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
ELPUB
1998
ACM
13 years 8 months ago
Research Information Take Away or How to Serve Research Information Fast and Friendly on the Web
In 1997 the library department at the University of Karlskrona/Ronneby was asked to develop a database which could be used to collate and present all the research material and ong...
Peter Linde, Leif Lagebrand
DAGM
2005
Springer
13 years 9 months ago
A Fast Algorithm for Statistically Optimized Orientation Estimation
Filtering a signal with a finite impulse response (FIR) filter introduces dependencies between the errors in the filtered image due to overlapping filter masks. If the filteri...
Matthias Mühlich, Rudolf Mester