云计算在RSA密码体制分析中的应用

RSA是著名的公钥密码体制之一,其安全性是基于大整数因子分解困难性假设的,求解RSA问题的最直接方法是分解RSA的模数.由于云计算的大规模分布式计算能力,一些使用分布式计算模型MapReduce的大整数分解手段已经实现,针对大整数因子分解的问题,提出了给定范围内搜索因子的新方法,并对相应的实验数据和结果进行了分析.结果表明,在云中的分布式计算的运行时间远小于单台机器.     

On time versus size for monotone dynamic monopolies in regular topologies

We consider a well-known distributed colouring game played on a simple connected graph: initially, each vertex is coloured black or white; at each round, each vertex simultaneously recolours itself by the colour of the simple (strong) majority of its neighbours. A set of vertices M is said to be a dynamo, if starting the game with only the vertices of M coloured black, the computation eventually reaches an all-black configuration.The importance of this game follows from the fact that it models the spread of faults in point-to-point systems with majority-based voting; in particular, dynamos correspond to those sets of initial failures which will lead the entire system to fail. Investigations on dynamos have been extensive but restricted to establishing tight bounds on the size (i.e., how small a dynamic monopoly might be).In this paper we start to study dynamos systematically with respect to both the size and the time (i.e., how many rounds are needed to reach all-black configuration) in various models and topologies.We derive tight tradeoffs between the size and the time for a number of regular graphs, including rings, complete d-ary trees, tori, wrapped butterflies, cube connected cycles and hypercubes. In addition, we determine optimal size bounds of irreversible dynamos for butterflies and shuffle-exchange using simple majority and for DeBruijn using strong majority rules. Finally, we make some observations concerning irreversible versus reversible monotone models and slow complete computations from minimal dynamos.     

Optimal broadcast on parallel locality models

In this paper matching upper and lower bounds for broadcast on general purpose parallel computation models that exploit network locality are proven. These models try to capture both the general purpose properties of models like the PRAM or BSP on the one hand, and to exploit network locality of special purpose models like meshes, hypercubes, etc., on the other hand. They do so by charging a cost l(|i−j|) for a communication between processors i and j, where l is a suitably chosen latency function.An upper bound T(p)=∑_i=0^loglogp2ⁱ·l(p^1/2i) on the runtime of a broadcast on a p processor H-PRAM is given, for an arbitrary latency function l(k).The main contribution of the paper is a matching lower bound, holding for all latency functions in the range from l(k)=Ω(logk/loglogk) to l(k)=O(log²k). This is not a severe restriction since for latency functions l(k)=O(logk/log¹⁺log(k)) with arbitrary >0, the runtime of the algorithm matches the trivial lower bound Ω(logp) and for l(k)=Θ(log¹⁺k) or l(k)=Θ(k), the runtime matches the other trivial lower bound Ω(l(p)). Both upper and lower bounds apply for other parallel locality models like Y-PRAM, D-BSP and E-BSP, too.     

Method of developing all-optical parallel to serial converter exploiting Kerr non-linearity of medium

Different all-optical logic operations, memory blocks etc. are developed using the inherent parallelism of optics. In any digital communication and computation system, the role of serial to parallel and parallel to serial data conversion are very much essential for making a data convenient for transition.Here in this paper, the authors propose a new scheme for developing an all-optical parallel to serial data conversion system by using optical J-K Flip-Flops and some logic gates based on optical non-linear switches. The uses of such switches are widely established in the area of optical parallel computation.This process can be extend for developing some all-optical digital devices like shift register, optical pulse counters etc. The proposed scheme deals with the best use of high parallelism of the optics, so the super-fast processing speed can be achieved.     

Large-scale forcing with less communication in finite-difference simulations of stationary isotropic turbulence

This study proposes a new forcing scheme suitable for massively-parallel finite-difference simulations of stationary isotropic turbulence. The proposed forcing scheme, named reduced-communication forcing (RCF), is based on the same idea as the conventional large-scale forcing scheme, but requires much less data communication, leading to a high parallel efficiency. It has been confirmed that the RCF scheme works intrinsically in the same manner as the conventional large-scale forcing scheme. Comparisons have revealed that a fourth-order finite-difference model run in combination with the RCF scheme (FDM-RCF) is as good as a spectral model, while requiring less computational costs. For the range 80 < Re_λ < 540, where Re_λ is the Taylor microscale-based Reynolds number, large computations using the FDM-RCF scheme show that the Reynolds dependences of skewness and flatness factors have similar power-laws as found in previous studies.     

Mixture diffusion of sulfonated dyes into cellulose membrane. III. Application of parallel diffusion model to binary system of direct dyes with different affinity

Mixture diffusion of two dyes (C.I. Direct Blue 15 (DB15) and C.I. Direct Yellow 12 (DY12)) with different affinity onto the substrate into cellulose membrane from the binary solution was studied at 55°C. Uptake curves and concentration–distance profiles were measured experimentally in the ratios (DB15:DY12) 1:0.5, 1:1 and 1:2. It was examined whether the diffusion of the dyes could be analyzed based on the parallel diffusion theory of surface and pore diffusion. It was revealed that the diffusion of DB15 with higher affinity could be analyzed based on the model in the ratios 1:0.5 and 1:1, although the theoretical value deviated slightly from the data in the concentration–distance profile in the ratio 1:1. On the other hand, the diffusion of DY12 with smaller affinity could not be described by the model, because the diffusivity of the dye changed during the adsorption process against the assumption of the model.     

Riemannian geometry of quantum computation

A review is given of some recent developments in the differential geometry of quantum computation for which the quantum evolution is described by the special unitary unimodular group, SU(2ⁿ). Using the Lie algebra su(2ⁿ), detailed derivations are given of a useful Riemannian geometry of SU(2ⁿ), including the connection and the geodesic equation for minimal complexity quantum computations.     

Improved algorithm about NSFOT

For the purpose of further saving computing time, an improved algorithm about NSFOT is provided in this paper. That is, by introducing the simple operations such as preprocessing or after-processing, Haar and Walsh transforms are performed conveniently on the multiprocessor. As a result, one large size problem is divided into several small size sub-problems, load on every processor not only decreases greatly but also gets so uniform that much time is saved. Both the theoretical analysis and experimental results demonstrate the effectiveness of the proposed approach.     

Minimizing the number of machines for minimum length schedules

In this paper, we present a new objective function for scheduling on parallel machines: minimizing the number of machines for schedules of minimum length. We study its complexity and we prove the NP-completeness of this problem, even if there is no precedences or for unitary execution times. We propose several polynomial algorithms for various particular cases.     

Incompact3d: A powerful tool to tackle turbulence problems with up to O(105) computational cores

Understanding the nature of complex turbulent flows remains one of the most challenging problems in classical physics. Significant progress has been made recently using high performance computing, and computational fluid dynamics is now a credible alternative to experiments and theories in order to understand the rich physics of turbulence. In this paper, we present an efficient numerical tool called Incompact3d that can be coupled with massive parallel platforms in order to simulate turbulence problems with as much complexity as possible, using up to O(10⁵) computational cores by means of direct numerical simulation (DNS). DNS is the simplest approach conceptually to investigate turbulence, featuring the highest temporal and spatial accuracy and it requires extraordinary powerful resources. This paper is an extension of Laizet et al.(Comput. Fluids 2010; 39 (3):471–484) where the authors proposed a strategy to run DNS with up to 1024 computational cores. Copyright © 2010 John Wiley & Sons, Ltd.