Implementations of the Advanced Encryption Standard (AES) have rapidly grown in various applications including telecommunications, finance and networks that require a low power consumption and low cost design. Present...
详细信息
Implementations of the Advanced Encryption Standard (AES) have rapidly grown in various applications including telecommunications, finance and networks that require a low power consumption and low cost design. Presented in this thesis is a new 8-bit stream cipher architecture core for an application specific integrated circuit AES crypto-processor. The chip area and power are optimised along with high throughput by employing circuit-level techniques, resource sharing and low supply voltage. The proposed design includes a novel S-box/ InvS-box, MixColumn/ InvMixColumn and ShiftRow/ InvShiftRow with a novel low power Exclusive OR (XOR) gate applied to all sub systems to minimise the power consumption. It is implemented in a 130nm CMOS process and supports both encryption and decryption in Electronic Codebook Mode (EBC) using 128-bit keys with a throughput of 0.05Gbit/s (at 100MHz clock). This design utilises 3152 gate equivalents, including an on-the-fly key scheduling unit along with 4.23μW/MHz power consumption. The area of the chip is 640μm×325μm (0.208 square mm), excluding the bonding pads. Compared to other 8-bit implementations, the proposed design achieves a smaller chip size along with higher throughput and lower power dissipation. This thesis also describes a new fault detection scheme for S-box/ InvS-box that is parity prediction based to protect the key from fault attacks.%%%%The following articles were removed due to copyright restrictions:Ahmad, N., Hasan, R. (2013) "A 0.8 V 0.23 nW 1.5 ns full-swing pass-transistor XOR gate in 130 nm CMOS", Active and passive electronic components, 1-6; Ahmad, N., Rezaul Hasan, S.M., (2012) "Efficient integrated AES crypto-processor architecture for 8-bit stream cipher", Electronic Letters, IET, 48:23, 1456-1457; Ahmad, N., Rezaul Hasan, S.M. (2013) "Low-power compact composite field AES S-Box/Inv S-Box design in 65nm CMOS using Novel XOR Gate", Integration, the VLSI Journal, 46:4, 333-345;Ahmad, N., Hasan, R. (2012) "T
In this paper, we propose an average connectivity degree cluster (ACDC) scheme gossip algorithm to improve the convergence speed and the accuracy of the consensus, when a common decision is needed for a certain phenom...
详细信息
In this paper, we propose an average connectivity degree cluster (ACDC) scheme gossip algorithm to improve the convergence speed and the accuracy of the consensus, when a common decision is needed for a certain phenomenon in a distributed network. We analyze the effects of the initial value, the network topology (regular and irregular), and the number of clusters on the algorithm convergence rate as well as the accuracy of the value when reaching consensus. A utility function is developed based on two parameters, iteration and relative error, to help the network designers make an optimal decision based on their requirements. An irregular sensor model which is based on the degree of irregular (DOI) radius is introduced to evaluate the robustness of the algorithm. The simulation results demonstrate that for any initial value and network topology, the proposed ACDC gossip algorithm can yield results that are 50% closer to the real average value than the referenced standard gossip and grid cluster gossip algorithms. With different DOI values, our ACDC gossip algorithm can still reach lower relative error compared with other gossip algorithms, which demonstrates that our algorithm is robust enough to be executed in the network.
We present a multihistogram reweighting technique for nonequilibrium Markov chains with discrete energies. The method generalizes the single-histogram method of Yin et al. [Phys. Rev. E 72, 036122 (2005)], making it p...
详细信息
We present a multihistogram reweighting technique for nonequilibrium Markov chains with discrete energies. The method generalizes the single-histogram method of Yin et al. [Phys. Rev. E 72, 036122 (2005)], making it possible to calculate the time evolution of observables at a posteriori chosen couplings based on a set of simulations performed at other couplings. In the same way as multihistogram reweighting in an equilibrium setting improves the practical reweighting range as well as use of available data compared to single-histogram reweighting, the method generalizes the multihistogram advantages to nonequilibrium simulations. We demonstrate the procedure for the Ising model with Metropolis dynamics, but stress that the method is generally applicable to a range of models and Monte Carlo update schemes.
We devise powerful algorithms based on differential evolution for adaptive many-particle quantum metrology. Our new approach delivers adaptive quantum metrology policies for feedback control that are orders-of-magnitu...
详细信息
We devise powerful algorithms based on differential evolution for adaptive many-particle quantum metrology. Our new approach delivers adaptive quantum metrology policies for feedback control that are orders-of-magnitude more efficient and surpass the few-dozen-particle limitation arising in methods based on particle-swarm optimization. We apply our method to the binary-decision-tree model for quantum-enhanced phase estimation as well as to a new problem: a decision tree for adaptive estimation of the unknown bias of a quantum coin in a quantum walk and show how this latter case can be realized experimentally.
We use a great deal of wireless sensor nodes to detect target signal that is more accurate than the traditional single radar detection method. Each local sensor detects the target signal in the region of interests and...
详细信息
We use a great deal of wireless sensor nodes to detect target signal that is more accurate than the traditional single radar detection method. Each local sensor detects the target signal in the region of interests and collects relevant data, and then it sends the respective data to the data fusion center (DFC) for aggregation processing and judgment making whether the target signal exists or not. However, the current judgment fusion rules such as Counting Rule (CR) and Clustering-Counting Rule (C-CR) have the characteristics on high energy consumption and low detection precision. Consequently, this paper proposes a novel Weight-based Clustering Decision Fusion Algorithm(W-CDFA) to detect target signal in wireless sensor network. It first introduces the clustering method based on tree structure to establish the precursor-successor relationships among the clusters in the region of interests and then fuses the decision data along the direction from the precursor clusters to the successor clusters gradually, and DFC (i.e., tree root) makes final determination by overall judgment values from subclusters and ordinary nodes. Simulation experiments show that the fusion rule can obtain more satisfactory system level performance at the environment of low signal to noise compared with CR and C-CR methods.
Optimizing the path planning to reduce the time and cost is an essential consideration in modern society, and existing research has mostly concentrated on static path planning and real-time data information in vehicle...
详细信息
Optimizing the path planning to reduce the time and cost is an essential consideration in modern society, and existing research has mostly concentrated on static path planning and real-time data information in vehicle navigational applications. Using dynamic path planning to adjust and update the path information in time is a challenging approach to reduce road congestion and traffic accidents. In this paper, we present a data analysis algorithmthat determines an efficient dynamic path for vehicle repair-scrap sites and navigates more flexibly to avoid obstacles, where the key idea is to design the sensor wireless network that helps to obtain data from different devices. Firstly, the data processing scheme for real-time data with regional cluster and node division can be obtained from different sensor devices through the wireless senor network. Secondly, the search space and the relevant road information are restricted to a strongly connected graph. The most important strategy for an optimal solution to find the shortest path is the search method. Finally, to validate the performance of our design and algorithm, we have conducted a simulation based on necessary traffic variables. The performance simulation results show that real-time dynamic path planning can be significantly optimized using our data processing scheme.
The congestion control algorithm based on the weighted directed graph is designed for the network congestion over the wireless sensor network. The congestion problem is modeled as a distributed dynamic system with tim...
详细信息
The congestion control algorithm based on the weighted directed graph is designed for the network congestion over the wireless sensor network. The congestion problem is modeled as a distributed dynamic system with time-varying delay, and it can be proven that the sent rate for all nodes converges to the available bandwidth of the sink by the proposed congestion control algorithm. Via Lyapunov function, the validity of the proposed algorithm is shown under the varying network topologies. Ns simulation results indicate that the proposed algorithm restrains the congestion over the wireless sensor network, maintains a high throughput and a low delay time, and also improves the quality of service for the whole network.
The imposition of a cost constraint for constructing the optimal navigation structure surely represents a crucial ingredient in the design and development of any realistic navigation network. Previous works have focus...
详细信息
The imposition of a cost constraint for constructing the optimal navigation structure surely represents a crucial ingredient in the design and development of any realistic navigation network. Previous works have focused on optimal transport in small-world networks built from two-dimensional lattices by adding long-range connections with Manhattan length rij taken from the distribution Pij∼rij−α, where α is a variable exponent. It has been shown that, by introducing a cost constraint on the total length of the additional links, regardless of the strategy used by the traveler (independent of whether it is based on local or global knowledge of the network structure), the best transportation condition is obtained with an exponent α=d+1, where d is the dimension of the underlying lattice. Here we present further support, through a high-performance real-time algorithm, on the validity of this conjecture in three-dimensional regular as well as in two-dimensional critical percolation clusters. Our results clearly indicate that cost constraint in the navigation problem provides a proper theoretical framework to justify the evolving topologies of real complex network structures, as recently demonstrated for the networks of the US airports and the human brain activity.
Haigang Gong 1 and Mei Yang 2 and Wenzhong Li 3 and Nianbo Liu 1 1, School of computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China 2, Department of Electric...
详细信息
Haigang Gong 1 and Mei Yang 2 and Wenzhong Li 3 and Nianbo Liu 1 1, School of computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China 2, Department of Electrical and computer Engineering, University of Nevada-Las Vegas, Las Vegas, NV 89119, USA 3, Department of computer Science and Technology, Nanjing University, Nanjing 210093, China Received 25 June 2013; Accepted 25 June 2013 This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. In view of the effectiveness of ant colony algorithms in solving combinatorial optimization problems, an ant-based heuristic algorithm (ASTRL) is proposed to address the optimal transmission range assignment for the goal of achieving life maximization of sensor networks.
暂无评论