基于多基表示的滑动窗口椭圆曲线多标量乘算法

标量乘运算从整体上决定了椭圆曲线密码体制的快速实现效率，在一些椭圆曲线公钥密码体制中需要计算多标量乘。多基数链的标量表示长度更短、非零比特数目更少，较好地适用于椭圆曲线标量乘的快速计算。为了提高椭圆曲线密码的效率，在已有的二进制域和素域的标量乘算法的基础上，结合滑动窗口技术、多基算法，提出新的更高效的多标量乘算法。实验结果表明，新算法与传统Shamir算法和交错NAF算法相比，其所需的运算量更少，能有效地提高椭圆曲线多标量乘算法的效率，使多标量乘的运算更高效。相比于其他算法，新算法的计算效率比已有的多标量乘算法提高了约7.9%~20.6%。     

Two-party secure connection in Bluetooth-enabled devices

Secure Simple Pairing, a Bluetooth-pairing protocol, suffers from passive off-line and active online-guessing attack. These assaults are a direct result of the shortcomings in Bluetooth specification. Bluetooth technology uses the principles of device inquiry and inquiry scan. Scanning devices listen in on known frequencies for devices that are actively inquiring. If two Bluetooth devices know absolutely nothing about each other, one must run an inquiry to try to discover the other. One device sends out the inquiry request, and any device listening for such a request will respond with its address, and possibly its name, Input/Output capability and other information. Before connection, each device knows the address, their name, their capability, Quality-of-Service, etc. During pairing, Man-In-The-Middle attacker may capture all the information of connecting devices and impersonate them. This paper introduces the security augmentation in Bluetooth pairing by postponing exchange of Input-Output capability and other information like Quality-of-Service until it is essentially required and by casing the link key with a pair of Elliptic Curve Diffie-Hellman keys. Consequently, this leads to increased pairing time. Yet, we overlooked the increased pairing time, as the proposed Bluetooth-pairing protocol improves security by strengthening the link key.     

Solving separable elliptic equations by the block stride reduction algorithm

A comparison of the Buneman version of the block cyclic reduction (BCR) algorithm and Stride Reduction (BSR) based on polynomial factorization for separable elliptic equations with Dirichlet boundary conditions is presented. This study was initiated by an interest in the parallel computing techniques that can be used to increase the computational efficiency of these model problems     

The behaviour of pin-ended flange elements in compression

Stowell's solution [1] for the buckling behaviour of flange elements in compression was premised on the assumption that the element was fixed against flexural rotations at the ends, a condition representing relatively thick elements for which the thickness dimension is adequate to prevent rotations. This paper presents a solution similar to Stowell's which is applicable to pin-ended flange elements. Aspects not considered in Stowell's work, such as the use of elliptic functions to describe the gradual change of mode shape from sinusoidal to essentially linear, and the gradual and asymptotic changes in axial rigidity in the post-buckling range are described in the paper. The paper also presents comparisons between the behaviour of pin-ended and fixed-ended flange elements. Finally, simple strength equations for flange elements in uniform compression based on the first yield criterion are derived.     

Simulations of four independent groups of hamiltonian circuited unknowns in the numerical solutions of elliptic partial differential equations

Past experiments on Hamiltonian circuited simulations of the partial differential equation of the Poisson type have indicated the influences of the Hamiltonian circuits on algebraic structures of coefficients matrices. The need to tend to the usage of finite difference schemes is also observed. A certain Hamiltonian circuit is found to enable the decomposition of the space of simulated points into two subspaces. This paper reports that the space can in fact be separated into four subspaces. Numerical simulations are carried out using a 7-point finite difference star. The results are compared with those obtained when the simulated points are divided into only two disjoint sets.     

Preconditioned rotated iterative methods in the solution of elliptic partial differential equation

A second-order finite difference scheme derived from rotated discretisation formula is employed in conjunction with a preconditioner to obtain highly accurate and fast numerical solution of the two-dimensional elliptic partial differential equation. The use of a ‘splitting’ preconditioning strategy will be shown to improve the spectral properties of the matrix of the linear system resulting from this discretisation by minimising the eigenvalue spectrum of the transformed matrix. The application of this technique to several acceleration iterative methods, such as Simultaneous displacement, Richardson's and Chebyshev accelerated methods, are presented and discussed.     

Computing Prime Factorization And Discrete Logarithms: From Index Calculus To Xedni Calculus

The integer factorization problem (IFP), the finite field discrete logarithm problem (DLP) and the elliptic curve discrete logarithm problem (ECDLP) are essentially the only three mathematical problems that the practical public-key cryptographic systems are based on. For example, the most famous RSA cryptosystem is based on IFP, the US government's Digital Signature Standard, DSS, is based on DLP, whereas the ECC (Elliptic Curve Cryptography) and Elliptic Curve Digital Signature Algorithm (ECDSA) are based on ECDLP. The security of such cryptographic systems relies on the computational intractability of these three mathematical problems. In this paper, we shall present a survey of various methods for solving the IFP/DLP and particularly the ECDLP problems. More specifically, we shall first discuss how the index calculus as well as quantum algorithms can be used to solve IFP/DLP. Then we shall show why the index calculus cannot be used to solve ECDLP. Finally, we shall introduce a new method, xedni calculus , due to Joseph Silverman, for attack ECDLP; some open problems and new research directions, will also be addressed.     

Thermal Stress Analysis for Octagonal Quasicrystals

The complex variable method for solving the two-dimensional thermal stress problem of octagonal quasicrystals is stated. The closed-form solutions for octagonal quasicrystals containing an elliptical hole subjected to a remote uniform heat flow are obtained. When the hole degenerates into a crack, the explicit solutions for the stress intensity factors and energy release rate are presented.     

Parallel Collision Search with Cryptanalytic Applications

A simple new technique of parallelizing methods for solving search problems which seek collisions in pseudorandom walks is presented. This technique can be adapted to a wide range of cryptanalytic problems which can be reduced to finding collisions. General constructions are given showing how to adapt the technique to finding discrete logarithms in cyclic groups, finding meaningful collisions in hash functions, and performing meet-in-the-middle attacks such as a known-plaintext attack on double encryption. The new technique greatly extends the reach of practical attacks, providing the most cost-effective means known to date for defeating: the small subgroup used in certain schemes based on discrete logarithms such as Schnorr, DSA, and elliptic curve cryptosystems; hash functions such as MD5, RIPEMD, SHA-1, MDC-2, and MDC-4; and double encryption and three-key triple encryption. The practical significance of the technique is illustrated by giving the design for three $10 million custom machines which could be built with current technology: one finds elliptic curve logarithms in GF(2¹⁵⁵) thereby defeating a proposed elliptic curve cryptosystem in expected time 32 days, the second finds MD5 collisions in expected time 21 days, and the last recovers a double-DES key from two known plaintexts in expected time 4 years, which is four orders of magnitude faster than the conventional meet-in-the-middle attack on double-DES. Based on this attack, double-DES offers only 17 more bits of security than single-DES. Received 21 December 1995 and revised 24 September 1996     

Plastic buckling of complete toroidal shells of elliptical cross-section subjected to internal pressure

The plastic bifurcation buckling pressures of 60 internally-pressurised, perfect, complete toroidal shells of elliptical cross-section are given in the present paper, assuming elastic, perfectly plastic, material behaviour. The shell buckling programs employed in the computations were BOSOR 5 and INCA. Denoting the major-to-minor axis ratio by k, the numerical results show that the plastic buckling pressures are considerably lower than their elastic counterparts in the range 1.25≤k≤1.5 and are approximately equal to them for k=2.5. A limited study of the effects of non-axisymmetric initial geometric imperfections on the buckling pressures of the shells was also carried out using the INCA code. For the four cases studied the post-buckling behaviour was stable. This means that designers can use the buckling pressures given herein for perfect shells as a basis for their initial designs.