A Parallel Algorithm for determining the inverse of a matrix for use in blockcipher encryption/decryption

In the current world that we live in, of rapid growing technology, and especially reliance on the Internet for our daily lively hood (Banking, shopping, entertainment, news), and also with current crimes (Identity-theft, hacking, spyware), computer security is becoming more and more important. By “computer security” we often refer to addressing three important aspects of a computer-related system: Confidentiality, integrity, and availability. Encryption clearly addresses the need for confidentiality of data, both in storage and transmission. However, the use of encryption can be cumbersome and time consuming. It is important to have a fast algorithm to both encrypt and decrypt data as needed. Public key encryption, though secure, is definitely not fast enough to be used for large size data. We introduce a Parallel Algorithm for computation of inverses of matrices modulo n. This is used in conjunction with Block Ciphers and Hill Ciphers in symmetric encryption and decryption of data for transmission on open lines. Experimental studies were done to compare the run-time of this algorithm on parallel machines, to the traditional one. The new algorithm was found to perform much better than the traditional one, and would be useful to use in encryption/decryption of large sensitive data.

ElGamal型签名算法分批验证及其安全性

在９４年欧洲密码会上，Ｎａｃｃａｃｈｅ等人为加速ＤＳＡ验证提出了两种分批验证；交互式分批和概率分批，Ｌｉｍ等人指出，签名者和验证者很容易伪造签名以满足交互式分批验证方程，因此，交互式分批验证方法很不安全，作者研究了ＥｌＧａｍａｌ型签名算法交互式分批验证及其安全性，并基于一些ＥｌＧａｍａｌ型签名算法，提出了３种新的交互式分批验证方案，讨论其安全性。     

Block cipher based on reversible cellular automata

We propose a new encryption algorithm relying on reversible cellular automata (CA). The behavior complexity of CA and their parallel nature makes them interesting candidates for cryptography. The proposed algorithm belongs to the class of symmetric key systems. Marcin Seredynski: He is a Ph.D. student at University of Luxembourg and Polish Academy of Sciences. He received his M.S. in 2004 from Faculty of Electronics and Information Technology in Warsaw University of Technology. His research interests include cryptography, cellular automata, nature inspired algorithms and network security. Currently he is working on intrusion detection algorithms for ad-hoc networks. Pascal Bouvry, Ph.D.: He earned his undergraduate degree in Economical & Social Sciences and his Master degree in Computer Science with distinction (’91) from the University of Namur, Belgium. He went on to obtain his Ph.D. degree (’94) in Computer Science with great distinction at the University of Grenoble (INPG), France. His research at the IMAG laboratory focussed on Mapping and scheduling task graphs onto Distributed Memory Parallel Computers. Next, he performed post-doctoral researches on coordination languages and multi-agent evolutionary computing at CWI in Amsterdam. He gained industrial experience as manager of the technology consultant team for FICS in the banking sector (Brussels, Belgium). Next, he worked as CEO and CTO of SDC (Ho Chi Minh city, Vietnam) in the telecom, semi-conductor and space industry. After that, He moved to Montreal Canada as VP Production of Lat45 and Development Director for MetaSolv Software in the telecom industry. He is currently serving as Professor in the group of Computer Science and Communications (CSC) of the Faculty of Sciences, Technology and Communications of Luxembourg University and he is heading the Intelligent & Adaptive Systems lab. His current research interests include: ad-hoc networks & grid-computing, evolutionary algorithms and multi-agent systems.     

混沌系统在网络信息保密中的应用

提出一种利用混沌这种确定性系统的随机性实现对网络信息进行加密的策略,实验结果表明,这种保密方法在网络信息传输中可以很好完成加密和解密过程。     

Should one always use repeated squaring for modular exponentiation?

Modular exponentiation is a frequent task, in particular for many cryptographic applications. To accelerate modular exponentiation for very large integers one may use repeated squaring, which is based on representing the exponent in the standard binary numeration system. We show here that for certain applications, replacing the standard system by one based on Fibonacci numbers may yield a new line of time/space tradeoffs.     

A note on window τ-NAF algorithm

The window τ-adic algorithm of Solinas [Efficient arithmetic on Koblitz curves, Designs, Codes and Cryptography 19 (2000) 195] is the most powerful method for computing point multiplication for Koblitz curves. In this note, the existence of a more general window τ-adic form for each element in Z[τ] is obtained. In particular, this provides a proof of the termination of Solinas algorithm.     

基于双密钥的三维Vigenere密码的研究与应用

分析了经典维吉尼亚密码及维吉尼亚方阵的相关概念,在此基础上提出了一个三维维吉尼亚立方体模型。该模型使用双密钥对明文进行二次加密,削弱了密文的统计频率特征。理论分析表明,该算法在两个短密钥控制下达到了单个长密钥的加密效果,可以对明文进行一次一密加密,极大地提高了解密难度。     

Partition Algorithm For Parallel Processing Of Array Multiplication In Gf(2m) Fields

The multiplication operations in GF(2m) fields are widely used in cryptosystems. However, the multiplication operations for public-key cryptosystems require very large operands with 512 bits or more, and then existing multipliers are not available for such multiplications. In this paper, we will present a partition algorithm to divide large operands into small operands such as 32 bits or 64 bits, and then existing multipliers can be employed. We also present a parallel version of the partition algorithm by employing an important natural property of the multiplication operations in GF(2m) fields.     

Control Points for Multivariate B-Spline Surfaces over Arbitrary Triangulations

This paper describes first results of a test implementation that implements the new multivariate B-splines as recently developed by Dahmen et al. 10for quadratics and cubics. The surface scheme is based on blending functions and control points and allows the modelling of   C ^{k − 1}  -continuous piecewise polynomial surfaces of degree k over arbitrary triangulations of the parameter plane. The surface scheme exhibits both affine invariance and the convex hull property, and the control points can be used to manipulate the shape of the surface locally. Additional degrees of freedom in the underlying knot net allow for the modelling of discontinuities. Explicit formulas are given for the representation of polynomials and piecewise polynomials as linear combinations of B-splines.     

Modular machine tools: Design and barriers to industrial implementation

The Reconfigurable Manufacturing System (RMS) paradigm has been developed to address challenges in the design of manufacturing systems and equipment that will meet the demands of modern manufacturing. This research involved the development of Modular Reconfigurable Machines (MRMs); as an emerging technology in reconfigurable manufacturing. MRMs are mechanically modular machines. The modularity permits the kinematic architecture and processing functions of the machine to be reconfigured to meet changing production requirements. This paper will focus on aspects of the mechanical design and the development of a control system that supported the modularity and reconfigurability of the mechanical platform. A modular electronic system is presented that is characterized by a plug and play approach to control scalability. This is complemented by a software architecture that has been developed with a focus on hardware abstraction for the management of an augmented mechanical and electronic architecture. The implications of MRMs for RMSs are discussed and key inhibitors to industrial implementation are identified.     

Ideal contrast visual cryptography schemes with reversing

A visual cryptography scheme (VCS) for a set of n participants is a method to encode a secret image, consisting of black and white pixels, into n transparencies, one for each participant. Certain qualified subsets of participants can “visually” recover the secret image by stacking their transparencies, whereas, other, forbidden, subsets of participants, cannot gain any information about the secret image.Recently, Viet and Kurosawa proposed a VCS with reversing, which is a VCS where the participants are also allowed to reverse their transparencies, i.e., to change black pixels to white pixels and vice-versa. They showed how to construct VCSs with reversing where the reconstruction of black (white, respectively) pixels is perfect, whereas, the reconstruction of white (black, respectively) pixels is almost perfect. In both their schemes there is a loss of resolution, since the number of pixels in the reconstructed image is greater than that in the original secret image.In this paper we show how to construct VCSs with reversing where reconstruction of both black and white pixels is perfect. In our schemes each participant is required to store a certain number of transparencies, each having the same number of pixels as the original secret image. Moreover, our schemes guarantee no loss of resolution, since the reconstructed image is exactly the same as the original secret image. Finally, compared to the schemes of Viet and Kurosawa, our schemes require each participant to store a smaller amount of information.     

Computer software as text

Participatory design strategies have placed the user at the center of the design process, leaving computer software designers without guidelines for how to design and implement the software system. This paper aims to bring the designer back to the center of the design process. and the way of doing it is to consider computer software as text. Three different text theories are presented in order to explain what is meant by text, namely pragmatics, structuralism and deconstructivism. Finally it is discussed how the design processes should be understood, and how they should be organized when taking the text point of view of computer software.     

钻杆对焊计算机控制系统的设计与实现

文章介绍了一个钻杆对焊计算机控制系统。该系统分为两个子系统：对中和消除应力子系统、淬火子系统。该系统实现钻杆对焊过程中的时中及热处理中的测量与控制任务。控制采用基于Ｔ－Ｓ模型的模糊控制器和广义预测控制器。软件在 Ｗｉｎｄｏｗｓ９８操作系统下运行。软件来用功能模块化设计方法,用可视化的 Ｖｉｓｕａｌ Ｃ＋＋语言和 Ｖｉｓｕａｌ Ｂａｓｉｃ语言编程。该系统已投入运行,显示了很好的控制效果。     

On security measures in distributed computer systems

Problems of data security are becoming increasingly acute. This study of these basic problems has been carried out in cooperation between scientists at the Department of Electrical Engineering at Linköping Institute of Technology and FOA 3 (Försvarets Forskningsanstalt Planeringsbyrån — Research Institute of National Defense, Operations Research Center).The situation considered is an office with individual work stations having desktop computers. These communicate among themselves and share a host computer of higher capacity including special purpose input/output equipment.Among questions discussed are:

• * problems related to the protection of data bases

• * ease of selectively designating addressees and authorisation to access data and messages; key distribution and protection

• * general requirements for equipment needed in such a local net environment.

No attempt has been made to predict when such distributed office computer systems will become commonly available in full scale. It does, however, seem clear that they are at least technically feasible already.     

密码技术在反计算机病毒中的应用

主要介绍了密码技术在反计算机病毒中的一些应用。     

“大学计算机基础”课程教学方法探索

通过分析目前＂大学计算机基础＂课程教学中存在的问题,提出了相应的解决方案,并提出了模块化教学与＂任务驱动型＂教学结合的教法。     

基于某型控制盒单板测试仪通用测试系统的研究

为了满足控制盒单板测试通用化、模块化的要求,在自动测试系统的设计中采用了虚拟仪器测控技术,提出新的设计方案;讨论了自动测试系统的功能、硬件配置、软件模块化设计、软件流程和工作原理,设计开发了基于虚拟仪器技术的通用测试系统。该系统容错能力强,通用性好,操作方便,具有良好的扩展性,对提高武器系统的可维护性和可靠性有重要的意义。