<![CDATA[ IEEE Transactions on Computers - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 12 2018February 19<![CDATA[Special Section on Secure Computer Architectures]]>673305306144<![CDATA[Hybrid Obfuscation to Protect Against Disclosure Attacks on Embedded Microprocessors]]>673307321875<![CDATA[On Practical Discrete Gaussian Samplers for Lattice-Based Cryptography]]>6733223341075<![CDATA[Hardware/Software Co-Design of an Accelerator for FV Homomorphic Encryption Scheme Using Karatsuba Algorithm]]>[1] . Following this trend, this work investigates the benefits of using Karatsuba algorithm instead of FFT for the Fan-Vercauteren (FV) Homomorphic Encryption scheme. The proposed accelerator relies on an hardware/software co-design approach, and is designed to perform fast arithmetic operations on degree 2,560 polynomials with 135 bits coefficients, allowing to compute small algorithms homomorphically. Compared to a functionally equivalent design using FFT, our accelerator performs an homomorphic multiplication in 11.9 ms instead of 15.46 ms, and halves the size of logic utilization and registers on the FPGA.]]>6733353471118<![CDATA[Bitstream Fault Injections (BiFI)–Automated Fault Attacks Against SRAM-Based FPGAs]]>not require any reverse-engineering. Our attacks can be automatically mounted without any detailed knowledge about either the bitstream format or the design of the crypto primitive which is being attacked. Bitstream encryption features do not necessarily prevent our attack if the integrity of the encrypted bitstream is not carefully checked. We have successfully verified the feasibility of our attacks in practice by considering several publicly available AES designs. As target platforms, we have conducted our experiments on Spartan-6 and Virtex-5 Xilinx FPGAs.]]>6733483601526<![CDATA[Hardware-Based Trusted Computing Architectures for Isolation and Attestation]]>673361374573<![CDATA[GliFreD: Glitch-Free Duplication Towards Power-Equalized Circuits on FPGAs]]>6733753871914<![CDATA[Achieving Load Balance for Parallel Data Access on Distributed File Systems]]>hard disk head and network bandwidth, resulting in a degraded I/O performance. In this paper, we first conduct a complete analysis on how remote and imbalanced read/write patterns occur and how they are affected by the size of the cluster. We then propose novel methods, referred to as Opass, to optimize parallel data reads, as well as to reduce the imbalance of parallel writes on distributed file systems. Our proposed methods can benefit parallel data-intensive analysis with various parallel data access strategies. Opass adopts new matching-based algorithms to match processes to data so as to compute the maximum degree of data locality and balanced data access. Furthermore, to reduce the imbalance of parallel writes, Opass employs a heatmap for monitoring the I/O statuses of storage nodes and performs HM-LRU policy to select a local optimal storage node for servin-
write requests. Experiments are conducted on PRObE’s Marmot 128-node cluster testbed and the results from both benchmark and well-known parallel applications show the performance benefits and scalability of Opass.]]>6733884022741<![CDATA[A Multiplexer-Based Arbiter PUF Composition with Enhanced Reliability and Security]]>673403417865<![CDATA[Randomized Mixed-Radix Scalar Multiplication]]>$mathbb {Z}$-covering if each integer belongs to at least one congruence class from that set. In this paper, we first show that most existing scalar multiplication algorithms can be formulated in terms of covering systems of congruences. Then, using a special form of covering systems called exact $n$-covers, we present a novel uniformly randomized scalar multiplication algorithm with built-in protections against most passive side-channel attacks. Our algorithm randomizes the addition chain using a mixed-radix representation of the scalar. Its reduced overhead and purposeful robustness could make it a sound replacement to several conventional countermeasures. In particular, it is significantly faster than Coron's scalar blinding technique for elliptic curves when the choice of a particular finite field tailored for speed compels to double the size of the scalar, hence the cost of the scalar multiplication.]]>673418431824<![CDATA[Towards the Design of Efficient and Consistent Index Structure with Minimal Write Activities for Non-Volatile Memory]]>6734324481899<![CDATA[Digit Serial Methods with Applications to Division and Square Root]]>$V$. Bounds on these digits, and on the errors in the associated estimates of $V$ formed from these digits, are derived. To illustrate our results, we derive such bounds for a parameterized family of high-radix algorithms for division and square root. These bounds enable a DSM designer to determine, for example, whether a given choice of parameters allows rapid formation and rounding of its approximation to $V$ .]]>673449456511