Sciweavers

252 search results - page 50 / 51
» How Secure is Deterministic Encryption
Sort
View
CSL
2010
Springer
13 years 8 months ago
Embedding Deduction Modulo into a Prover
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
Guillaume Burel
SPW
2004
Springer
14 years 28 days ago
The Dancing Bear: A New Way of Composing Ciphers
This note presents a new way of composing cryptographic primitives which makes some novel combinations possible. For example, one can do threshold decryption using standard block c...
Ross Anderson
CHES
2007
Springer
327views Cryptology» more  CHES 2007»
14 years 1 months ago
On the Power of Bitslice Implementation on Intel Core2 Processor
Abstract. This paper discusses the state-of-the-art fast software implementation of block ciphers on Intel’s new microprocessor Core2, particularly concentrating on “bitslice i...
Mitsuru Matsui, Junko Nakajima
ISSTA
2010
ACM
13 years 9 months ago
The Google FindBugs fixit
In May 2009, Google conducted a company wide FindBugs “fixit”. Hundreds of engineers reviewed thousands of FindBugs warnings, and fixed or filed reports against many of the...
Nathaniel Ayewah, William Pugh
FDTC
2010
Springer
132views Cryptology» more  FDTC 2010»
13 years 5 months ago
Fault Injection Resilience
Fault injections constitute a major threat to the security of embedded systems. The errors in the cryptographic algorithms have been shown to be extremely dangerous, since powerful...
Sylvain Guilley, Laurent Sauvage, Jean-Luc Danger,...