With the increasing development of SSD (Solid-State Drives) technology, SSD RAID (Redundant Arrays of Independent Disks) has been widely deployed in enterprise data centers. However, the inherent write endurance issue of SSD seriously affects the reliability of the array. Meanwhile, compared with conventional HDD-based RAID, SSD RAID exhibits very different failure characteristics, such as correlated failure (Balakrishnan et al., 2010) under RAID-5. In this paper, we present a Hybrid High reliability RAID architecture, named H-RAID, by equipping each SSD with an extra HDD as the backup to improve the reliability of SSD RAID. Considering the relatively longer write latency of HDD, in H-RAID, we first propose an HDD-aware backup mechanism to smartly aggregate random writes into sequential writes to decrease performance degradation. In addition, to cope with the scenarios of SSD failure, an HDD-aware reconstruction method is further proposed to guarantee the reliability and the online transaction processing performance. We build a novel Markov process-based mathematical model to analyze the reliability of different architectures, and the theoretical results prove the reliability of H-RAID is much higher than that of traditional SSD RAID. To more accurately evaluate the performance influence of HDD on H-RAID, we develop a simulator based on Disksim and the experimental results show H-RAID significantly increases the reliability compared with SSD array (under RAID-5) while with little performance loss on average.
Machine learning techniques are commonly employed in the context of Side Channel Analysis attacks. The clustering algorithms can be successfully used as classifiers in single execution attacks against implementations of Elliptic Curve point multiplication known as kP operation. They can distinguish between the processing of ‘ones’ and ‘zeros’ during secret scalar processing in the binary kP algorithm. The successful SCA performed by designers can aid in recognizing the leakage sources in cryptographic designs and lead to improvement of the cryptographic implementations. In this work we investigate the influence of the hamming weight of scalar k on the success rate of the single-trace attack. We used the clustering method K-means and the statistical method the comparison to the mean. We analysed simulated power traces and power traces of an FPGA implementation to conclude that K-means, unlike the comparison to the mean, was able to deal with extracting the scalar even when it is consisted of less than 30% of ‘ones’ and more than 70% of ‘ones’.