there are plenty of modes of operation for block ciphers available. All of them are developed as ciphers9; extension or enhancement tool to gain better security or additional features. NITS had defined 5 modes as t...
详细信息
ISBN:
(纸本)0780381149
there are plenty of modes of operation for block ciphers available. All of them are developed as ciphers' extension or enhancement tool to gain better security or additional features. NITS had defined 5 modes as the standards;they are ECB, CBC, CFB, OFB and CTR mode. Among these modes, the CTR mode is the one that capable to be fully parallelized and possess more security features. However the disadvantage in the implementation of CTR mode is the deviation of the counter value between the encryptor and decryptor. the synchronization of the counter value can be easily lost during delivery or transmission, hence affecting the integrity of the system. this paper proposed a method to eliminate the synchronization issue by calculating the initial counter value from the initial value. the new counter value is calculated using an algorithm comprises of the cipher algorithm and a hash algorithm. this new method introduce minimum overhead at the beginning of each encryption or decryption process. By using the enhanced version of CTR mode, the implementation has become simplified, while maintaining its attractive features of better security and its ability of parallelprocessing.
the proceedings contain 149 papers. the special focus in this conference is on parallel, Distributed architectures, Scheduling and Load Balancing. the topics include: Session guarantees to achieve pram consistency of ...
ISBN:
(纸本)3540219463
the proceedings contain 149 papers. the special focus in this conference is on parallel, Distributed architectures, Scheduling and Load Balancing. the topics include: Session guarantees to achieve pram consistency of replicated shared objects;an extended atomic consistency protocol for recoverable DSM systems;hyper-threading technology speeds clusters;configurable microprocessor array for DSP applications;on generalized moore digraphs;RDMA communication based on rotating buffers for efficient parallel fine-grain computations;communication on the fly in dynamic SMP clusters;accelerated diffusion algorithms on general dynamic networks;suitability of load scheduling algorithms to workload characteristics;minimizing time-dependent total completion time on parallel identical machines;diffusion based scheduling in the agent-oriented computing system;approximation algorithms for scheduling jobs with chain precedence constraints;combining vector quantization and ant-colony algorithm for mesh-partitioning;wavelet-neuronal resource load prediction for multiprocessor environment;fault-tolerant scheduling in distributed real-time systems;online scheduling of multiprocessor jobs with idle regulation;predicting the response time of a new task on a beowulf cluster;space decomposition solvers and their performance in pc-based parallel computing environments;evaluation of execution time of mathematical library functions based on historical performance information;empirical modelling of parallel linear algebra routines;efficiency of divisible load processing;gray box based data access time estimation for tertiary storage in grid environment;performance modeling of parallel fem computations on clusters;asymptotical behaviour of the communication complexity of one parallel algorithm and analytical modeling of optimized sparse linear code.
Consider a parallel computer on which it is considerably cheaper to perform communications within close neighborhoods than globally. In such a context, it is not necessarily a good idea to simulate optimal PRAM algori...
详细信息
A kinematic analysis and mechanism description of a biglide parallel grinder with six-controlled degree of freedom is presented in this paper. In comparison with hexapod machines, the mechanical structure and motion o...
详细信息
A kinematic analysis and mechanism description of a biglide parallel grinder with six-controlled degree of freedom is presented in this paper. In comparison with hexapod machines, the mechanical structure and motion of this biglide parallel grinder are simple. therefore, it is easy for this biglide parallel grinder to accomplish real-time control. Its workspace-to-volume ratio is even larger than that of conventional machine tools, and there is also no singularity configuration. Because of using parallel fixed length links, this biglide parallel grinder can reduce the thermal deformation effects on its accuracy. In addition to grinding, this grinder can be used for welding, painting, fixturing, material handling and so on. (C) 2003 Published by Elsevier Science B.V.
作者：
Allard, JRaffin, BZara, FUJF
INRIA INPGCNRS Project ApACHE ID IMAGLab Informat & Distribut F-38330 Montbonnot St Martin France
Recent developments make it possible for PC clusters to drive multi-display visualization environments. this paper shows how we coupled parallel codes with distributed 3D graphics rendering, to enable interactions wit...
详细信息
ISBN:
(纸本)354040788X
Recent developments make it possible for PC clusters to drive multi-display visualization environments. this paper shows how we coupled parallel codes with distributed 3D graphics rendering, to enable interactions with complex simulations in multi-display environments.
A new algorithm for calculating A*B is presented. It is based on precomputation of a small number of values that allow for an efficient parallel implementation of multiplication. the algorithm requires 0(logn) time an...
详细信息
ISBN:
(纸本)354040788X
A new algorithm for calculating A*B is presented. It is based on precomputation of a small number of values that allow for an efficient parallel implementation of multiplication. the algorithm requires 0(logn) time and O(n(2)/logn(2)) area with small constant factors which makes it feasible for practical implementations.
A general real-space multigrid-based program package MIKA (Multigrid Instead of the K-spAce) for the self-consistent solution of the Kohn-Sham equations appearing in the state-of-the-art electronic structure calculati...
详细信息
A general real-space multigrid-based program package MIKA (Multigrid Instead of the K-spAce) for the self-consistent solution of the Kohn-Sham equations appearing in the state-of-the-art electronic structure calculations is described. the most important part of the method is the multigrid solver for the Schrodinger equation. Our choice is the Rayleigh quotient multigrid method (RQMG), which applies directly to the minimization of the Rayleigh quotient on the finest level. Coarse correction grids can be used because there is in principle no need to represent the states on the coarse levels. the RQMG method is generalized for the simultaneous solution of all the states of the system using a penalty functional to keep the states orthogonal. Special care has been taken to optimize the iterations toward the self-consistency and run the code in parallel computer architectures. the scheme has been implemented in multiple geometries. We show examples from electronic structure calculations employing nonlocal pseudopotentials and/or the jellium model. the RQMG solver is also applied for the calculation of positron states in solids. (C) 2002 Wiley Periodicals, Inc.
the dynamics equation of robot manipulators is non linear and coupled. An inverse dynamic control algorithm that requires a full knowledge of the dynamics of the system is one way to solve the control movement. Adapti...
详细信息
Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tree skeletons have been proposed to simplify para...
详细信息
ISBN:
(纸本)354040788X
Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tree skeletons have been proposed to simplify parallel programming on trees, few studies have been reported on how to systematically use them in solving practical problems;it is neither clear how to make a good combination of skeletons to solve a given problem, nor obvious even how to find suitable operators used in a single skeleton. In this paper, we report our first attempt to resolve these problems, proposing. two important transformations, the tree diffusion transformation and the tree context preservation transformation. the tree diffusion transformation allows one to use familiar recursive definitions to develop his parallel programs, while the tree context preservation transformation shows how to derive associative operators that are required when using tree skeletons. We illustrate our approach by deriving an efficient parallel program for solving a nontrivial problem called the party planning problem, the tree version of the famous maximum-weight-sum problem.
暂无评论