A high-throughput chaotic advection microreactor for preparation of uniform and aggregated barium sulfate nanoparticles

A high-throughput (105.5 g/h) passive four-stage asymmetric oscillating feedback microreactor using chaotic mixing mechanism was developed to prepare aggregated Barium sulfate (BaSO₄) particles of high primary nanoparticle size uniformity. Three-dimensional unsteady simulations showed that chaotic mixing could be induced by three unique secondary flows (i.e., vortex, recirculation, and oscillation), and the fluid oscillation mechanism was examined in detail. Simulations and Villermaux–Dushman experiments indicate that almost complete mixing down to molecular level can be achieved and the prepared BaSO₄ nanoparticles were with narrow primary particle size distribution (PSD) having geometric standard deviation, σ_g, less than 1.43 when the total volumetric flow rate Q_total was larger than 10 ml/min. By selecting Q_total and reactant concentrations, average primary particle size can be controlled from 23 to 109 nm as determined by microscopy. An average size of 26 nm with narrow primary PSD (σ_g = 1.22) could be achieved at Q_total of 160 ml/min.     

风速时间序列混沌判定方法比较研究

混沌识别是对非线性时间序列进行混沌预测的前提。针对时间序列风速确定性与随机性相结合的复杂非线性特征,研究了不同的混沌识别方法,并对风速时间序列进行混沌特征识别。应用随机噪声、周期运动及经典混沌系统的时间序列对所选方法进行可靠性验证。对美国国家风能研究中心M2测风塔实测时间序列风速数据进行非线性混沌特征识别。结果表明:风速时间序列具有明显的混沌特征;各风速时间序列表现出不同程度的混沌特征;各混沌识别方法对风速时间序列混沌特征的表达形式不同,互为补充,相互验证。     

一种标准模型下无证书签名方案的安全性分析与改进

无证书签名具有基于身份密码体制和传统公钥密码体制的优点，可解决复杂的公钥证书管理和密钥托管问题.Wu和Jing提出了一种强不可伪造的无证书签名方案，其安全性不依赖于理想的随机预言机.针对该方案的安全性，提出了两类伪造攻击.分析结果表明，该方案无法实现强不可伪造性，并在"malicious-but-passive"的密钥生成中心攻击下也是不安全的.为了提升该方案的安全性，设计了一个改进的无证书签名方案.在标准模型中证明了改进的方案对于适应性选择消息攻击是强不可伪造的，还能抵抗恶意的密钥生成中心攻击.此外，改进的方案具有较低的计算开销和较短的私钥长度，可应用于区块链、车联网、无线体域网等领域.     

Criteria on existence of horseshoes near homoclinic tangencies of arbitrary orders

Consider (m + 1)-dimensional, m ≥ 1, diffeomorphisms that have a saddle fixed point O with m-dimensional stable manifold W^s(O), one-dimensional unstable manifold W^u(O), and with the saddle value σ different from 1. We assume that W^s(O) and W^u(O) are tangent at the points of some homoclinic orbit and we let the order of tangency be arbitrary. In the case when σ < 1, we prove necessary and sufficient conditions of existence of topological horseshoes near homoclinic tangencies. In the case when σ > 1, we also obtain the criterion of existence of horseshoes under the additional assumption that the homoclinic tangency is simple.     

Low-cost and two-cycle hardware structures of PRINCE lightweight block cipher

In this paper, low-cost and two-cycle hardware structures of the PRINCE lightweight block cipher are presented. In the first structure, we proposed an area-constrained structure, and in the second structure, a high-speed implementation of the PRINCE cipher is presented. The substitution box (S-box) and the inverse of S-box (S-box⁻¹) blocks are the most complex blocks in the PRINCE cipher. These blocks are designed by an efficient structure with low critical path delay. In the low-cost structure, the S-boxes and S-boxes⁻¹ are shared between the round computations and the intermediate step of PRINCE cipher. Therefore, the proposed architecture is implemented based on the lowest number of computation resources. The two-cycle implementation of PRINCE cipher is designed by a processing element (PE), which is a general and reconfigurable element. This structure has a regular form with the minimum number of the control signal. Implementation results of the proposed structures in 180-nm CMOS technology and Virtex-4 and Virtex-6 FPGA families are achieved. The proposed structures, based on the results, have better critical path delay and throughput compared with other's related works.     

Low area field-programmable gate array implementation of PRESENT image encryption with key rotation and substitution

Lightweight ciphers are increasingly employed in cryptography because of the high demand for secure data transmission in wireless sensor network, embedded devices, and Internet of Things. The PRESENT algorithm as an ultra-lightweight block cipher provides better solution for secure hardware cryptography with low power consumption and minimum resource. This study generates the key using key rotation and substitution method, which contains key rotation, key switching, and binary-coded decimal-based key generation used in image encryption. The key rotation and substitution-based PRESENT architecture is proposed to increase security level for data stream and randomness in cipher through providing high resistance to attacks. Lookup table is used to design the key scheduling module, thus reducing the area of architecture. Field-programmable gate array (FPGA) performances are evaluated for the proposed and conventional methods. In Virtex 6 device, the proposed key rotation and substitution PRESENT architecture occupied 72 lookup tables, 65 flip flops, and 35 slices which are comparably less to the existing architecture.     

基于水印和密码技术的数字版权保护模式

综合考虑数字版权保护的实际需求和安全隐患,结合水印技术和密码技术提出了一种新的数字版权保护模式(WCDRM),模式中共有7个实体,其中有3个权威机构。讨论了模式的注册过程、在线交易过程、验证过程和仲裁过程,该模式可以提供多种服务。模式将作者身份标识、版权发行机构身份标识和消费者身份标识作为盲信息水印数据隐藏在数据作品中,还采用了密码算法、密码协议和水印协议技术,可以抵抗各种算法攻击和协议攻击,具有较高的安全性和较好的实用性