Workload control in job shops with re-entrant flows: an assessment by simulation

One of the key functions of Workload Control is order release. Jobs are not released immediately onto the shop floor – they are withheld and selectively released to create a mix of jobs that keeps work-in-process within limits and meet due dates. A recent implementation of Workload Control’s release method highlighted an important issue thus far overlooked by research: How to accommodate re-entrant flows, whereby a station is visited multiple times by the same job? We present the first study to compare the performance of Workload Control both with and without re-entrant flows. Simulation results from a job shop model highlight two important aspects: (i) re-entrant flows increase variability in the work arriving at a station, leading to a direct detrimental effect on performance; (ii) re-entrant flows affect the release decision-making process since the load contribution of all visits by a job to a station has to fit within the norm. Both aspects have implications for practice and our interpretation of previous research since: (i) parameters given for work arriving may significantly differ from those realised; (ii) increased workload contributions at release mean that prior simulations may have been unstable, leading to some jobs never being released.     

A parallelized eno procedure for direct numerical simulation of compressible turbulence

In this paper, a finite-difference based ENO (essentially nonoscillatory) procedure has been chosen for the direct numerical simulation (DNS) of compressible turbulence. The implementation of the ENO scheme follows the relatively efficient procedure in Shuet al. (1992), but the latter has been modified in the present paper to admit scalar conservation equations and to run on the iPSC/860 Paragon parallel supercomputer. DNS results with our procedure are in excellent agreement with pseudo-spectral and Padé approximation calculations in two and three dimensions. This is the case for a variety of initial conditions for compressible turbulence. The parallel algorithms presented are simple but quite efficient for DNS, with a speedup that approaches the theoretical value. Some of the attractive features include 1) minimum communication whereby a processor only communicates with two neighbors, 2) almost one hundred percent load balancing, 3) a checker-board approach to solve the Poisson equation reduces communication by a factor of approximately 2, and, 4) obtaining turbulence statistics is based on a global collect approach, which is implemented to ensure that a single number, rather than a large matrix of numbers, is communicated between processors. The ENO code presented in this paper should be quite useful in its own right, while the parallel implementation should allow the simulation of fairly realistic problems.     

A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges

Based on the computational Diffie-Hellman problem, this paper proposes an identity-based authenticated key agreement protocol which removes bilinear pairings. Compared with previous protocols, the new protocol minimizes message exchange time with no extra cost. The protocol provides strong security guarantees including key compromise impersonation resilience, perfect forward secrecy, and master key forward secrecy. A security proof with the modular approach in the modified Bellare-Rogaway model is also provided.     

基于身份的椭圆曲线密码体制安全组播方案

提出一个应用椭圆曲线密码体制进行密钥协商而在基于身份的公钥密码系统内进行组通信的全新安全组播方案,分析子组成员的密钥协商和子组间的通信过程,以及组成员动态变化时密钥的更新过程。结果表明,该方案在降低计算和通信代价方面可取得较好的效果,且满足密钥协商的安全要求。     

Efficient utilization of elliptic curve cryptosystem for hierarchical access control

The elliptic curve cryptosystem (ECC) has recently received significant attention by researchers due to its high performance, low computational cost, and small key size. In this paper, an efficient key management and derivation scheme based on ECC is proposed to solve dynamic access problems in a user hierarchy. Compared to previous ECC based works, the proposed method does not require constructing interpolate polynomials, therefore, the computational complexity of key generation and key derivation is significantly reduced. At the same time, time complexity of adding/deleting security classes, modifying their relationships, and changing of secret keys is decreased in the proposed method.     

基于分簇的Ad Hoc网络密钥协商协议

以节点的公钥证书为基础,基于椭圆曲线密码体制提出一种分簇结构的Ad Hoc网络会话密钥协商协议,对协议的安全性和效率进行分析。该协议满足普遍认可的密钥协商安全要求,可抵抗中间人攻击、重放攻击、消息伪造攻击等多种攻击,有效地降低终端的计算、存储能力需求,减少了协商过程的通信开销。     

一种子秘密可更新的动态多秘密共享方案

基于椭圆曲线密码体制提出一个动态的多秘密共享方案。该方案具有参与者子秘密定期更新的功能,可以动态更新需要共享的秘密,灵活地增加或删除参与者成员,能够在一次秘密共享过程中共享多个秘密。通过使用椭圆曲线上的签密算法,使分发者和参与者之间的通信无需安全信道,从而保证安全性和实用性。     

具有消息恢复的指定验证者的代理盲签名

设计了一种新的具备消息恢复特性的指定验证者的代理盲签名方案.方案的安全性建立在椭圆曲线离散对数难解性之上,并对其进行了安全性分析.方案在验证签名过程中,消息可恢复出来.另外,方案节省了信息的传输量,有效地降低成本,有广泛的应用价值.     

改进的Koblitz曲线上数字签名算法

标量乘法的效率决定着椭圆曲线密码体制的性能,而JSF算法是当前最流行的计算椭圆曲线双标量乘的算法;Koblitz曲线上的快速标量乘算法是标量乘法研究的重要课题。Lee[12]算法采用Frobenius映射扩展正整数k并将其扩展后的系数改写成二进制形式有效地提高标量乘算法效率。将JSF应用到扩展后的系数中,以较小存储空间为代价来提高算法效率,并将算法运用到改进的ECDSA算法中,减少乘法运算次数,加速签名及验证过程,节约数字签名时间。     

基于OpenSSL嵌入式椭圆曲线加密系统

针对嵌入式系统中信息安全的特点,选择椭圆曲线公钥密码体制ECC(Elliptic Curves Cryptosystem)作为加解密系统体制,应用开源安全软件开发包OpenSSL作为密码库开发了加解密系统。详细介绍了椭圆曲线密码体制的两种常用算法:EC-ELGamal与Menezes-Vanstone,在arm-linux平台上开发了完整的上述两种算法的加解密系统,在实际应用中对比、分析了两种算法的优缺点。分析表明:EC-ELGamal与Menezes-Vanstone两种椭圆曲线密码体制算法分别有其适合应用的领域。实践证明:OpenSSL在arm-linux和其他类型的嵌入式平台加密系统的设计方面有很大的易用性、通用性。