102 research outputs found
Construction of generalized-involutory MDS matrices
Maximum Distance Separable (MDS) matrices are usually used to be diffusion
layers in cryptographic designs. The main advantage of involutory MDS matrices lies in
that both encryption and decryption share the same matrix-vector product. In this paper,
we present a new type of MDS matrices called generalized-involutory MDS matrices, implementation
of whose inverse matrix-vector products in decryption is the combination of the
matrix-vector products in encryption plus a few extra XOR gates. For the purpose of verifying
the existence of such matrices, we found 4 × 4 Hadamard generalized-involutory MDS
matrix over GF(24) consuming as little as 38 XOR gates with 4 additional XOR gates for
inverse matrix, while the best previous single-clock implementation in IWSEC 2019 needs
46 XOR gates with 51 XOR gates for inverse matrix. For GF(28), our results also beat the
best previous records in ToSC 2017
Recommended from our members
Reliability-oriented optimization of computation offloading for cooperative vehicle-infrastructure systems
Computation offloading is critical for mobile applications that are sensitive to computational power, while dynamic and random nature of vehicular networks makes it challenging to guarantee the reliability of vehicular computation offloading. In this letter, we propose a reliability-oriented stochastic optimization model based on dynamic programming for computation offloading in the presence of the deadline constraint on application execution. Specifically, a theoretical lower bound of the expected reliability of computation offloading is derived, and then an optimal data transmission scheduling mechanism is proposed to maximize the lower bound with consideration of randomness in vehicle-to-infrastructure (V2I) communications. Experimental results demonstrate that our mechanism can outperform the conventional scheme and benefits vehicular computation offloading in terms of reliability performance in stochastic situations
Recommended from our members
A microbial inspired routing protocol for VANETs
We present a bio-inspired unicast routing protocol for vehicular Ad Hoc Networks which uses the cellular attractor selection mechanism to select next hops. The proposed unicast routing protocol based on attractor selecting (URAS) is an opportunistic routing protocol, which is able to change itself adaptively to the complex and dynamic environment by routing feedback packets. We further employ a multi-attribute decision-making strategy, the Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS), to reduce the number of redundant candidates for next-hop selection, so as to enhance the performance of attractor selection mechanism. Once the routing path is found, URAS maintains the current path or finds another better path adaptively based on the performance of current path, that is, it can self-evolution until the best routing path is found. Our simulation study compares the proposed solution with the state-of-the-art schemes, and shows the robustness and effectiveness of the proposed routing protocol and the significant performance improvement, in terms of packet delivery, end-to-end delay, and congestion, over the conventional method
Recommended from our members
Channel access optimization with adaptive congestion pricing for cognitive vehicular networks: an evolutionary game approach
Cognitive radio-enabled vehicular nodes as unlicensed users can competitively and opportunistically access the radio spectrum provided by a licensed provider and simultaneously use a dedicated channel for vehicular communications. In such cognitive vehicular networks, channel access optimization plays a key role in making the most of the spectrum resources. In this paper, we present the competition among self-interest-driven vehicular nodes as an evolutionary game and study fundamental properties of the Nash equilibrium and the evolutionary stability. To deal with the inefficiency of the Nash equilibrium, we design a delayed pricing mechanism and propose a discretized replicator dynamics with this pricing mechanism. The strategy adaptation and the channel pricing can be performed in an asynchronous manner, such that vehicular users can obtain the knowledge of the channel prices prior to actually making access decisions. We prove that the Nash equilibrium of the proposed evolutionary dynamics is evolutionary stable and coincides with the social optimum. Besides, performance comparison is also carried out in different environments to demonstrate the effectiveness and advantages of our method over the distributed multi-agent reinforcement learning scheme in current literature in terms of the system convergence, stability and adaptability
Recommended from our members
Reliability-optimal cooperative communication and computing in connected vehicle systems
The emergence of vehicular networking enables distributed cooperative computation among nearby vehicles and infrastructures to achieve various applications that may need to handle mass data by a short deadline. In this paper, we investigate the fundamental problems of a cooperative vehicle-infrastructure system (CVIS): how does vehicular communication and networking affect the benefit gained from cooperative computation in the CVIS and what should a reliability-optimal cooperation be? We develop an analytical framework of reliability-oriented cooperative computation optimization, considering the dynamics of vehicular communication and computation. To be specific, we propose stochastic modeling of V2V and V2I communications, incorporating effects of the vehicle mobility, channel contentions and fading, and theoretically derive the probability of successful data transmission. We also formulate and solve an execution time minimization model to obtain the success probability of application completion with the constrained computation capacity and application requirements. By combining these models, we develop constrained optimizations to maximize the coupled reliability of communication and computation by optimizing the data partitions among different cooperators. Numerical results confirm that vehicular applications with a short deadline and large processing data size can better benefit from the cooperative computation rather than non-cooperative solutions
Recommended from our members
Joint mobility, communication and computation optimization for UAVs in air-ground cooperative networks
Unmanned aerial vehicles (UAVs) play a significant role in various 5G or Beyond-5G (B5G)-enabled Internet-of-Things (IoT) applications. However, the UAV performance in an air-ground cooperative network is significantly affected by its mobility and air-to-ground (A2G) communication and computation behaviors. In this paper, a UAV-oriented computation offloading system is investigated, where the UAV desires to complete its onboard computation demands with the assistance of a ground edge-computing infrastructure, i.e., a road-side unit (RSU). The objective is to maximize the energy efficiency of the UAV. Specifically, a non-convex constrained optimal control problem is formulated to optimize the overall energy efficiency of UAV by jointly considering the coupled effects of UAV's longitudinal mobility, A2G communication, and computation dynamics. To address the coupled complexity and non-convexity of the original problem, a primal decomposition approach is developed to transform the problem into a convex subproblem and a primary problem, and then a closed-form optimal transmission power control is derived by solving the subproblem, which is dependent on mobility information. By embedding the closed-form optimal power control into the primary problem, a gradient projection-based iterative algorithm is proposed to obtain a joint optimal solution for both the longitudinal acceleration control and the power control, the feasibility and convergence of which is also theoretically proven. Extensive simulations have been conducted to validate the effectiveness of the proposed method in terms of constraint satisfaction and convergence speed, and comparative results also demonstrate that it can outperform other benchmark methods in terms of global energy efficiency
Recommended from our members
Weighted energy efficiency maximization for a UAV-assisted multi-platoon mobile edge computing system
With the rapid development of mobile computing, mobile edge computing has increasingly become an essential means to meet the computing power requirements of intelligent networked vehicles. However, users with high mobility and coupled dynamics are rarely considered in the edge computing paradigms. In this paper, we studied a UAV-assisted mobile edge computing system with multi-platoon vehicles. Our paper aims to maximize the system’s weighted global energy efficiency, which can flexibly adjust each vehicle’s energy consumption according to user preferences and system needs. In particular, we design a controller for platooning vehicles based on a two-dimensional path-following model and Frenet frames, and model the coupled characteristics of air-to-ground communications and onboard computation. Furthermore, due to the non-convexity of the objective function and constraints of the optimization problem, we propose an optimization algorithm based on the sequential quadratic programming method. The simulation results show that the proposed method significantly surpasses conventional schemes
New Subquadratic Algorithms for Constructing Lightweight Hadamard MDS Matrices (Full Version)
Maximum Distance Separable (MDS) Matrix plays a crucial role in designing cryptosystems. In this paper we mainly talk about constructing lightweight Hadamard MDS matrices based on subquadratic multipliers over . We firstly propose subquadratic Hadamard matrix-vector product formulae (HMVP), and provide two new XOR count metrics. To the best of our knowledge, subquadratic multipliers have not been used to construct MDS matrices. Furthermore, combined with HMVP formulae we design a construction algorithm to find lightweight Hadamard MDS matrices under our XOR count metric. Applying our algorithms, we successfully find MDS matrices with the state-of-the-art fewest XOR counts for and involutory and non-involutory MDS matrices. Experiment results show that our candidates save up to and XOR gates for and matrices over respectively
Recommended from our members
Distributed task offloading optimization with queueing dynamics in multi-agent mobile-edge computing networks
Task offloading decision-making plays a key role in enabling mobile-edge computing (MEC) technologies in Internet-of-Things (IoT). However, it meets the significant challenges arising from the stochastic dynamics of task queueing in the application layer and coupled wireless interference in the physical layer in a distributed multi-agent network without any centralized communication and computing coordination. In this paper, we investigate the distributed task offloading optimization problem with consideration of the upper-layer queueing dynamics and the lower-layer coupled wireless interference. We first propose a new optimization model that aims at maximizing the expected offloading rate of multiple agents by optimizing their offloading thresholds. Then, we transform the problem into a game-theoretic formulation, which further leads to the design of a distributed best-response (DBR) iterative optimization framework. The existence of Nash equilibrium strategies in the game-theoretic model has been analyzed. For the individual optimization of each agent’s threshold policy, we further propose a programming scheme by transforming a constrained threshold optimization into an unconstrained Lagrangian optimization (ULO). The individual ULO is integrated into the DBR framework to enable agents to cooperate and converge to a global optimum in a distributed manner. Finally, simulation results are provided to validate the proposed method and demonstrate its significant advantage over other existing distributed methods. The numerical results also show that the proposed method can achieve comparable performance to a centralized optimization method
Optimal epidemic information dissemination in uncertain dynamic environment
Optimization of stochastic epidemic information dissemination plays a significant role in enhancing the reliability of epidemic networks. This letter proposes a multi-stage decision making optimization model for stochastic epidemic information dissemination based on dynamic programming, in which uncertainties in a dynamic environment are taken into account. We model the inherent bimodal dynamics of general epidemic mechanisms as a Markov chain, and a state transition equation is proposed based on this Markov chain. We further derive optimal policies and a theoretical closed-form expression for the maximal expected number of successfully delivered messages. The properties of the derived model are theoretically analyzed. Simulation results show an improvement in reliability, in terms of accumulative number of successfully delivered messages, of epidemic information dissemination in stochastic situations
- …