A crucial property required from software transactional memory systems (STMs) is that transactions, even ones that will eventually abort, will operate on consistent states. The only known technique for providing this property is through the introduction of a globally shared version clock whose values are used to tag memory locations. Unfortunately, the need for a shared clock moves STM designs ...

JCilk extends the Java language to provide call-return semantics for multithreading, much as Cilk does for C. Java’s built-in thread model does not support the passing of exceptions or return values from one thread back to the “parent” thread that created it. JCilk imports Cilk’s fork-join primitives spawn and sync into Java to provide procedure-call semantics for concurrent subcomputations. Th...

The Camellia block cipher has a 128-bit block length, a user key of 128, 192 or 256 bits long, and a total of 18 rounds for a 128-bit key and 24 rounds for a 192 or 256-bit key. It is a Japanese CRYPTRECrecommended e-government cipher, an European NESSIE selected cipher and an ISO international standard. In this paper, we describe a flaw in the approach used to choose plaintexts or ciphertexts ...

Transaction Memory (TM) is a concurrency control abstraction that allows the pro-grammer to specify blocks of code to be executed atomically as transactions. However,since transactional code can contain just about any operation attention must be paidto the state of shared variables at any given time. E.g., contrary to a database trans-action, if a TM transaction reads a stal...

We present the first specification-compliant constant-time FPGA implementation of Classic McEliece cryptosystem from third-round NIST’s Post-Quantum Cryptography standardization process. In particular, we complete including encapsulation and decapsulation modules as well key generation with seed expansion. All hardware are parametrizable, at compile time, security level performance parameters. ...