As technology scales down, leakage energy accounts for a greater proportion of total energy. Applying the drowsy technique to a cache, is regarded as one of the most efficient techniques for reducing leakage energy. However, it increases the Soft Error Rate (SER), thus, many researchers doubt the reliability of the drowsy technique. In this paper, we show several reasons why the instruction cac...

We describe a new simple but more powerful form of linear cryptanalysis. It appears to break AES (and undoubtably other cryptosystems too, e.g. SKIPJACK). The break is “nonconstructive,” i.e. we make it plausible (e.g. prove it in certain approximate probabilistic models) that a small algorithm for quickly determining AES-256 keys from plaintext-ciphertext pairs exists – but without constructin...

Linear single-error-correcting, double-error-detecting (SEC-DED) codes used for design of reliable memories cannot detect and can miscorrect some errors with large Hamming weights. In this paper we present several constructions of optimal nonlinear robust and partially robust codes, i.e. the Vasil’ev codes, the Phelps codes and the codes based on one switching constructions. The error detection...