Sciweavers

434 search results - page 60 / 87
» Logical Analysis of Hash Functions
Sort
View
112
Voted
LICS
1999
IEEE
15 years 4 months ago
Towards a Theory of Bisimulation for Local Names
Pitts and Stark have proposed the -calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model base...
Alan Jeffrey, Julian Rathke
ICFP
2003
ACM
16 years 12 days ago
Software is discrete mathematics
A three-year study collected information bearing on the question of whether studying mathematics improves programming skills. An analysis of the data revealed significant differen...
Rex L. Page
112
Voted
FDTC
2006
Springer
117views Cryptology» more  FDTC 2006»
15 years 4 months ago
DPA on Faulty Cryptographic Hardware and Countermeasures
Abstract. Balanced gates are an effective countermeasure against power analysis attacks only if they can be guaranteed to maintain their power balance. Traditional testing and reli...
Konrad J. Kulikowski, Mark G. Karpovsky, Alexander...
WCRE
2010
IEEE
14 years 10 months ago
Reverse Engineering Self-Modifying Code: Unpacker Extraction
—An important application of binary-level reverse engineering is in reconstructing the internal logic of computer malware. Most malware code is distributed in encrypted (or “pa...
Saumya K. Debray, Jay Patel
PODS
2010
ACM
205views Database» more  PODS 2010»
15 years 5 months ago
Positive higher-order queries
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
Michael Benedikt, Gabriele Puppis, Huy Vu