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.     

Secure image encryption scheme using 4D-Hyperchaotic systems based reconfigurable pseudo-random number generator and S-Box

This paper introduces the design of a hardware efficient reconfigurable pseudorandom number generator (PRNG) using two different feedback controllers based four-dimensional (4D) hyperchaotic systems i.e. Hyperchaotic-1 and -2 to provide confidentiality for digital images. The parameter's value of these two hyperchaotic systems is set to be a specific value to get the benefits i.e. all the multiplications (except a few multiplications) are performed using hardwired shifting operations rather than the binary multiplications, which doesn't utilize any hardware resource. The ordinary differential equations (ODEs) of these two systems have been exploited to build a generic architecture that fits in a single architecture. The proposed architecture provides an opportunity to switch between two different 4D hyperchaotic systems depending on the required behavior. To ensure the security strength, that can be also used in the encryption process in which encrypt the input data up to two times successively, each time using a different PRNG configuration. The proposed reconfigurable PRNG has been designed using Verilog HDL, synthesized on the Xilinx tool using the Virtex-5 (XC5VLX50T) and Zynq (XC7Z045) FPGA, its analysis has been done using Matlab tool. It has been found that the proposed architecture of PRNG has the best hardware performance and good statistical properties as it passes all fifteen NIST statistical benchmark tests while it can operate at 79.101-MHz or 1898.424-Mbps and utilize only 0.036 %, 0.23 %, and 1.77 % from the Zynq (XC7Z045) FPGA's slice registers, slice LUTs, and DSP blocks respectively. Utilizing these PRNGs, we design two 16 × 16 substitution boxes (S-boxes). The proposed S-boxes fulfill the following criteria: Bijective, Balanced, Non-linearity, Dynamic Distance, Strict Avalanche Criterion (SAC) and BIC non-linearity criterion. To demonstrate these PRNGs and S-boxes, a new three different scheme of image encryption algorithms have been developed: a) Encryption using S-box-1, b) Encryption using S-box-2 and, c) Two times encryption using S-box-1 and S-box-2. To demonstrate that the proposed cryptosystem is highly secure, we perform the security analysis (in terms of the correlation coefficient, key space, NPCR, UACI, information entropy and image encryption quantitatively in terms of (MSE, PSNR and SSIM)).     

基于信息熵抑制的大数据特征隐匿性加密仿真

针对传统大数据特征加密方法中大数据精度较差、加密耗时较长的问题,提出基于信息熵抑制的大数据特征隐匿性加密方法。分析信息熵抑制相关理论,采用信息熵映射函数对大数据分类,将信息熵抑制过程转化为计算2个文件相似性的过程,并根据余弦相似度公式以及Hamming距离值计算数据相似度,完成数据消冗。在完成数据消冗的基础上,分析分组密码方法和ECC加密方法,结合两种方法得到大数据特征隐匿性加密处理计算公式,实现基于信息熵抑制的大数据特征隐匿性加密。实验研究结果表明,所提方法能够有效去除冗余数据,提升大数据精度,加快数据加密的处理速度,高效完成大数据加密过程。     

高效可撤销的身份基在线离线加密方案

身份基加密（IBE）需要提供一种有效的成员撤销机制，然而，现有可撤销成员的IBE方案存在密钥更新和加密运算量过大的问题，可能使执行该操作的设备成为系统的瓶颈。将完全子树方法和在线离线技术相结合，通过修改指数逆类型IBE的密钥生成和加密算法，提出了一种高效可撤销的身份基在线离线加密方案。方案利用完全子树方法生成更新钥，使得撤销用户无法获得更新钥，进而失去解密能力；利用在线离线技术，将大部分加密运算在离线阶段进行预处理，使得在线阶段仅执行少量简单计算即可生成密文。与相关知名方案相比，该方案不仅提高密钥生成中心的密钥更新的效率，而且极大减少了轻量级设备的在线加密工作量，适合于轻量级设备保护用户隐私信息。     

适用于无线体域网的动态口令认证协议

无线体域网中传输的是与生命高度相关的敏感数据，身份认证是信息安全保护的第一道防线。现有的基于人体生物信息的身份认证方案存在信息难提取、偶然性大和误差性大的问题，基于传统密码学的认证方案需较大计算资源和能量消耗，并不适用于无线体域网环境。为此，在动态口令和非对称加密机制基础上，提出一种适用于无线体域网的动态口令双向认证轻量协议，并对其进行形式化分析。通过理论证明、SVO逻辑推理及SPIN模型检测得出：该协议满足双向认证，且能够抵御重放攻击、伪装攻击、拒绝服务器攻击和口令离线攻击，具有较高安全性。     

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

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

基于ATP-ABE的访问控制方案

对访问控制机制中存在的安全性和有效性的问题进行了研究，提出了基于访问树剪枝的属性加密ATP-ABE（Access Tree Pruning Attribute Based Encryption）的访问控制方案。当ATP-ABE算法需要访问它的树型结构访问策略时，通过剪枝处理访问树结构中包含用户ID属性节点的分支，提高了用户所有者DO（Data Owner）管理和控制属性的效率，更加有效地实现了数据共享。还为访问树结构设计了许可访问属性，使DO仍保留共享数据的关键属性，并且能够完全控制它们的共享数据。基于决策双线性密钥交换算法DBDH（Decisional Bilinear Diffie-Hellman）假设分析了ATP-ABE方案的安全性，研究结果表明与两种经典ABE方案比较，ATP-ABE更加有效地减少了算法的系统设置、私钥生成、密文大小、用户属性撤销以及加解密过程中的计算开销，并给出了定量结论。     

A time-aware searchable encryption scheme for EHRs

Despite the benefits of EHRs (Electronic Health Records), there is a growing concern over the risks of privacy exposure associated with the technologies of EHR storing and transmission. To deal with this problem, a time-aware searchable encryption with designated server is proposed in this paper. It is based on Boneh's public key encryption with keyword search and Rivest's timed-release cryptology. Our construction has three features: the user cannot issue a keyword search query successfully unless the search falls into the specific time range; only the authorized user can generate a valid trapdoor; only the designated server can execute the search. Applying our scheme in a multi-user environment, the number of the keyword ciphertexts would not increase linearly with the number of the authorized users. The security and performance analysis shows that our proposed scheme is securer and more efficient than the existing similar schemes.     

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.     

基于一种云计算数据保护的多级加密算法的应用研究

云计算是分布式计算技术的一种,其最基本的概念是透过网络将庞大的计算处理程序自动分拆成无数个较小的子程序,再交由多部服务器所组成的庞大系统经搜寻、计算分析之后将处理结果回传给用户。云计算中的数据泄漏已经成为云计算的巨大威胁,据不完全统计数据,仅在2019年1年,大约有超40亿条信息被泄露。这些信息涵盖科技、医疗、政府、金融、教育、制造等十几个领域数百个行业,数据泄露已经成为云计算中数据安全的巨大威胁。主要提出了一种多级加密算法,能更好地保护云计算中的数据,并能以极小的成本在云计算中得到应用。