针对密码与信息安全专业课程思政教学实践,以提升本专业思政质量效果为主线,提出"忠能培塑、战技融合、情智浸润"的专业课程思政教学理念,从国家需求、岗位要求、技术迫求和精神追求4个层面,构建"四层·四同"课程思政教学内容体系;从方法手段、长效机制、师资建设3个方面探讨密码与信息安全专业课程思政教学体系创新的方法路径,创新提出"滴灌、引流、浸润、潮涌"的课程思政教学方法,为相关专业开展思政教学创新与实践提供参考.

In high data-rate differential transmission, even small asymmetries can significantly impact signal integrity and electromagnetic compatibility performance. To address this issue, wideband common-mode filters have been developed. This paper presents the concept and calculation of the mixed-mode scatter parameter of differential signals. It discusses the features of wideband common-mode filters, including their operational mechanisms, analytical methods, and performance, with the aid of an illustrative example. Furthermore, this paper introduces three typical common-mode filters based on various structures, such as defected ground, electromagnetic band-gap, and metamaterials. The basic principles, typical characteristics, and latest research progress of each filter type are thoroughly explained. Ultimately, this paper aims to provide useful references for scholars studying the topic of high-speed differential transmission.

With the rapid development of authenticated encryption (AE) algorithms in recent years, especially after the CAESAR (Competition for Authenticated Encryption: Security, Applicability and Robustness) competition was launched, a large number of excellent authenticated encryption algorithms have emerged, making the analysis of authenticated encryption algorithms a hot research issue. The CAESAR competition was launched under the sponsorship of IACR in 2014, aiming to collect excellent authentication encryption algorithms from all over the world. SAEAES is a relatively excellent authentication encryption algorithm in the CAESAR competition. In this paper, the sponge structure of SAEAES is improved by introducing the MD (Merkle Damgard) iterative structure. At the same time, in order to improve the ability to resist collision attacks, fixed point attacks and cluster attacks, the MD iterative structure itself is also improved.

The ACE authentication encryption algorithm is an algorithm designed by Aagaard et al. and submitted to the international lightweight cryptographic algorithm standardization competition. It has the function of authentication encryption and hash algorithm. It has certain reference and research significance to analyze the security according to the uniqueness of its structure. Taking the ACE-AE-k algorithm as an example, it is the first time to conduct a chosen-plaintext forgery attack from both direct and indirect aspects. By reusing the Nonce twice to forge the plaintext, the time complexity and data complexity can be neglected, which successfully proved the vulnerability of the ACE authentication encryption algorithm in the case of Nonce reuse or misuse. Secondly, this paper proposed an indirect forgery attack scheme, and combined with the optimal differential characteristics obtained by SMT/SAT solution tools, the maximum expected differential characteristics probability of ACE-AE-k is set to 2 -253.78336 , which is higher than the probability of exhaustive attacks. On the premise of being discovered by a third party, the same authentication tag is generated to achieve the effect of monitoring or tampering, and the forgery attack is successfully realized.

In recent years, some general cryptographic technologies have been widely used in network platforms related to the national economy and people’s livelihood, effectively curbing network security risks and maintaining the orderly operation and normal order of society. However, due to the fast development and considerable benefits of quantum computing, the classical cryptosystem faces serious security threats, so it is crucial to analyze and assess the anti-quantum computing ability of cryptographic algorithms under the quantum security model, to enhance or perfect the design defects of related algorithms. However, the current design and research of anti-quantum cryptography primarily focus on the cryptographic structure or working mode under the quantum security model, and there is a lack of quantum security analysis on instantiated cryptographic algorithms. This paper investigates the security of AES-OTR, one of the third-round algorithms in the CAESAR competition, under the Q2 model. The periodic functions of the associated data were constructed by forging the associated data according to the parallel and serial structure characteristics of the AES-OTR algorithm in processing the associated data, and the periodic functions of the associated data were constructed multiple times based on the Simon quantum algorithm. By using the collision pair, two collision forgery attacks on the AES-OTR algorithm can be successfully implemented, and the period s is obtained by solving with a probability close to 1. The attacks in this paper caused a significant threat to the security of the AES-OTR algorithm.

Midori is a low energy block cipher proposed at ASIACRYPT 2015. It is composed of two variants: Midori64 and Midori128, with block sizes equal to 64 and 128 bits respectively. These two ciphers provide the function of both encryption and decryption for security communication and storage with minimal area and energy overhead. In this paper, the immunity of Midori64 against integral fault attacks is investigated. Based on integral properties of Midori64 and fault model, a method to broken this cipher is presented. By injecting random faults in the 5th round backwards in the encryption process, the faulty ciphertexts are obtained. Based on 4-round integral distinguisher of Midori64, the last round key is recovered by flittering the wrong key values. The experimental simulation results show that the key candidate values can be reduced from 264 to 231.2 by 16 sets faults injection. Using the last round key to decrypt the ciphertexts by one round, a same method can be used to recover the penultimate round key and thus the master key can be recovered by using the key expansion algorithm.

With the in-depth integration of deep learning and side-channel analysis (SCA) technology, the security threats faced by embedded devices based on the Internet of Things (IoT) have become increasingly prominent. By building a neural network model as a discriminator, the correlation between the side information leaked by the cryptographic device, the key of the cryptographic algorithm, and other sensitive data can be explored. Then, the security of cryptographic products can be evaluated and analyzed. For the AES-128 cryptographic algorithm, combined with the CW308T-STM32F3 demo board on the ChipWhisperer experimental platform, a Correlation Power Analysis (CPA) is performed using the four most common deep learning methods: the multilayer perceptron (MLP), the convolutional neural network (CNN), the recurrent neural network (RNN), and the long short-term memory network (LSTM) model. The performance of each model is analyzed in turn when the samples are small data sets, sufficient data sets, and data sets of different scales. Finally, each model is comprehensively evaluated by indicators such as classifier accuracy, network loss, training time, and rank of side-channel attacks. The experimental results show that the convolutional neural network CNN classifier has higher accuracy, lower loss, better robustness, stronger generalization ability, and shorter training time. The rank value is 2, that is, only two traces can recover the correct key byte information. The comprehensive performance effect is better.

NIST launched the CAESAR competition for the world in 2014, followed by the current LWC competition. The design and security analysis on authenticated encryption (AE) algorithm have aroused a great upsurge in the world, aiming to meet the needs of the confidentiality and authenticity of the information. At the same time, all kinds of ingenious design and the corresponding security analysis emerged in endlessly. Although the SCREAM algorithm failed to be selected in the third round of CAESAR competition, based on its unique design, it still has a good reference and research significance to carry out safety analysis. In this thesis, according to the relative independence of each module of the SCREAM algorithm structure, the Chosen-message forgery attack of SCREAM was proposed under the condition of one or more pairs of ciphertext, so as to forge the ciphertext and generate the correct authentication tag to pass the verification. Meanwhile, the effectiveness of this method was proved, and the corresponding probability of success was provided. Compared with the existing analysis results, this method has better operability and universality.

The SLIM algorithm is a block cipher algorithm proposed in recent years and used in the Internet of Things system, which can ensure the security of information transmission in network devices. To evaluate the ability of the ultra-lightweight block cipher algorithm SLIM to resist integral analysis, the bit propagation trajectory of the SLIM algorithm is characterized by using the theory based on the division property of bits and combined with mixed-integer linear programming (MILP). We have modeled the propagation of division property and called the Gurobi solver to search for the integral distinguisher of the SLIM algorithm. Experiments show that there are 9 rounds of integral distinguisher in the SLIM algorithm, which is the longest integral distinguisher searched by the algorithm at present, and a large number of 8-round integral distinguisher of the SLIM algorithm are found, which contain a large number of balanced bits.

Pyjamask算法是入围LWC竞赛第2轮的竞选算法之一.该算法结构简单、轻量高效,具有良好的非线性部件并行运算能力,引起了大量密码学者的高度关注.目前该算法的安全性问题研究相对较少,迫切需要新一轮的安全性评估.基于Pyjamask的结构与参数的特点,提出了一种对明文进行伪造的方法,可以准确伪造出认证标签.理论分析表明:选择1组明文时成功概率为1,数据复杂度和时间复杂度可忽略不计;选择s+1组明文时成功概率也为1,但对所选数据要求较高.

With the development of information technology, building an intelligent equipment system is receiving more and more attention. In this paper, a two-way authentication and information protection scheme based on lightweight encryption technology is proposed for the equipment management system, which establishes identity-based equipment authentication while ensuring the confidentiality and integrity of transmitted information. And the scheme applies to the resource-constrained environment, meets the requirements for the safe use of equipment, and solves the security problems caused by threats such as replay and tracking during information transmission.

In this paper, the affection on the performance of GPS frequency-domain narrowband anti-jamming is studied. The GPS receiving signal model under the condition of narrowband interference is described, and the influence of the window function on the signal-to-noise ratio and frequency resolution is emphasized. The process of frequency-domain narrowband anti-jamming reception is simulated, especially the influence of AGC on anti-jamming performance. The results show that when the interference-to-noise ratio is 37dB, the frequency domain anti-jamming method using AGC technology can effectively capture GPS signals.

Electronic contract is an important part of electronic commerce, and the key issue is how to ensure the fairness of contract signing. In view of some electronic contract signing protocols in the network environment can not achieve fairness completely or need the third party involved. This paper proposed a new concurrent signature in virtue of ECDSA scheme and applied it to a fair contract signing protocol. This new protocol based on ECDSA ensure the fairness of contract signing in virtue of ambiguous signatures become valid concurrently, and ensure the confidentiality of the contents of the contract without the third party involved. This protocol is applied to most electronic contract signing in network environment.

结合计算机密码学课程教学实践,提出将混合式、参与式教学理念运用到教学之中,包括如何实现学习环境的混合、学习资源的混合、学习方式的混合等,目的是让学生学会自己构建知识,培养学生的自主学习能力.

LBlock is a lightweight block cipher designed for tiny computing devices, such as RFID tags and sensor network nodes. The cipher algorithm iterates a Feistel structure with SP type round function by 32 rounds. Its block size is 64 bits and key size is 80 bits. The designers show that LBlock is resistant against most classical attacks, such as differential and linear cryptanalysis. This paper proposed a differential fault analysis on LBlock. By injecting faults in the 27th round to the 29th round, a differential fault attack on LBlock based on a nibble-oriented random fault model is presented. The experiment result shows that 4.3 faults on average could recover a round key. For reveal the whole key information, 13.3 faults on average are needed. This indicates that cryptographic devices supporting LBlock should be carefully protected.

Lightweight block cipher is usually used in smart environment to protect confidentiality as well as to authentication. TWINE is a lightweight block cipher proposed by Japan scholar in SAC 2012 suits for kinds of platform from software to hardware. The cipher algorithm iterates a generalized Feistel structure with an improved block shuffle each sub-block includes an SP type round function. It with 64-bit block size, supports 80/128-bit key size and has 36 rounds iteration. This paper further investigates the security of TWINE, presents a new related-key impossible differential attack on reduced-round TWINE with 80-bit key (i.e. TWINE-80). By choosing the relations of keys carefully and exploring an equivalent structure of TWINE based on analysis of the encryption process, we show a 17-round related-key differential and then construct a 15-round related-key impossible differential trial. By using this trail, a 24-round related-key impossible differential attack on TWINE-80 is conducted. The result shows that the known impossible differential attack on TWINE-80 can be improved by one round.

>Dear editor,As one of the most powerful cryptanalytic vectors,integral cryptanalysis[1]exploits the simultaneous relationship between multiple encryptions.In[1],the integral of f(x)over some subset V(V is not necessarily but often a linear subspace)is defined as follows:

为了评估轻量级分组密码算法Midori128的安全性,对Midori128算法进行了多维零相关线性分析.首先利用“中间相错”的方法构造了Midori128的6轮零相关线性逼近,然后基于所构造的6轮零相关线性逼近,对10轮Midori128进行了密钥恢复攻击.该攻击过程的数据复杂度约为2123.02个明密文对,计算复杂度为2120.68次10轮加密运算.结果表明,缩减至10轮的Midori128算法对于零相关线性分析方法是不免疫的.

The PRINCE is a light‐weight block cipher with the 64‐bit block size and 128‐bit key size . It is characterized by low power‐consumption and low latency . PRINCEcore is the PRINCE cipher without key‐whiting . For evaluating its security , a statistical testing on linear transformation is performed , and a statistical character matrix is given . By using the ?miss‐in‐the‐middle" technique , we construct a 5‐round impossible differential characteristic . Based on the 5‐round distinguisher , a 9‐round attack on the PRINCEcore is performed . For the 9‐round attack , the data complexity , time complexity and space complexity are 261.2 , 254.3 and 217.7 , respectively . The testing result shows that the PRINCEcore reduced to 9 rounds is not immune to impossible differential attack .

The PRINCE is a light-weight block cipher with the 64-bit block size and 128-bit key size. It is characterized by low power-consumption and low latency. PRINCEcore is the PRINCE cipher without key-whiting. For evaluating its security, a statistical testing on linear transformation is performed, and a statistical character matrix is given. By using the "miss-in-the-middle" technique, we construct 5-round zero-correlation linear approximations. Based on the 5-round distinguisher, a 9-round attack on the PRINCEcore is performed. The data complexity is 2(62.9) known plaintexts and the time complexity is 2(55.14) 9-round encryptions. The testing result shows that the PRINCEcore reduced to 9 rounds is not immune to multidimensional zero-correlation linear analysis.