Search

SM4 national security algorithm has been widely used in data encryption and decryption, However, with the explosive growth of the data volume of the Internet, there are problems such as the slow speed and high CPU utilization of the SM4 algorithm running in pure software mode, while the field programmable gate array or dedicated integrated circuit based on Verilog/VHDL has problems such as poor flexibility and difficulty in upgrading and maintenance. In order to solve the above problems, a design scheme of heterogeneous reconfigurable computing system based on SM4algorithm is proposed. Using high-level synthesis and heterogeneous reconfigurable technology, the customized computing architecture of SM4 algorithm’s electronic cipher book mode and counter mode is designed by optimizing the allocation and transmission of data memory, optimizing the loop, vectorizing the kernel and adding computing units, and the system is deployed on the FPGA heterogeneous platform. The experimental results show that the customized computing architecture of SM4-ECB and SM4-CTR, two mainstream operating modes, on the Intel Stratix 10 GX2800,has a throughput of 109.48Gbps and 63.73Gbps respectively, which is 232.63 times and 141.62 times the throughput of the corresponding mode on the Intel Xeon E5-2650 V2 CPU. The performance of the whole heterogeneous reconfigurable computing system composed of this core module, including data input, encryption and decryption, and output, has also reached 4.90 times and 3.56 times of that of pure software mode. This paper not only realizes customized acceleration for specific modes, but also flexibly supports different computing modes through hardware reconfiguration, taking into account the flexibility and efficiency of the system. [ABSTRACT FROM AUTHOR]

In the modern medical field of pathological diagnosis and surgical practice, it is necessary to perform three-dimensional reconstruction of CT (computed tomography) to realize three-dimensional visualization of two-dimensional images to improve the accuracy of diagnosis and operation. To address the current problems of time-consuming and poor accuracy of 3 D reconstruction, this paper proposed an improved MC (marching cubes) algorithm, which used an enclosing box segmentation algorithm to extract voxels containing equivalent surfaces, effectively improving the reconstruction efficiency, calculated the intersection of equivalent surfaces and voxels by using trilinear interpolation, thus improving the reconstruction accuracy. In order to ensure the security of medical information in cloud storage and network transmission, this paper proposed a three-dimensional model encryption scheme based on fractional Lorenz chaos, which realized the chaotic encryption of reconstruction data in the frequency domain. The experimental results show that the improved MC algorithm has good reconstruction efficiency and reconstruction accuracy, and the proposed encryption scheme can effectively protect the reconstructed 3 D data and resist exhaustive attacks, differential attacks and statistical attacks. [ABSTRACT FROM AUTHOR]

The increase of in-vehicle electronic equipment makes the in-vehicle network face more and more threats. The lack of authentication of the Electronic Control Unit in the in-vehicle network and the lack of encryption of the communication data of the Controller Area Network make the in-vehicle network vulnerable to replay, ECU injection, man-in-the-middle forged messages, eavesdropping, etc, Witch make serious consequences. Aiming at the current vehicle network threats, a vehicle network security communication model based on SecOC is proposed. This model uses the SM4 cryptographic algorithm and the improved key management based on Bkake2 s to realize the authentication of the vehicle ECU and the encryption and authentication of the vehicle network message. Finally, after analysis and testing, the model can protect the invehicle network security and be more efficient. [ABSTRACT FROM AUTHOR]

With the development of big data and the increase of encryption scenarios, it 's difficult to meet the requirements of encryption performance with only software-run encryption methods, and FPGA/ ASIC encryption systems implemented using Verilog/VHDL methods have poor flexibility and difficult maintenance and upgrades problem. In response to the above problems, this paper designed and implemented an AES algorithm encryption system based on heterogeneous reconfigurable computing, including three mainstream modes of AES algorithm ECB, CBC, CTR, each mode realized 128 bit, 192 bit, 256 bit encryption of three key sizes. This paper realized the hardware acceleration of the module based on FPGA, and realized the dynamic switching of different modes and different bit width encryption modules based on the hardware reconfigurable mechanism. By implementing and verifying the system on Intel Stratix 10, the experimental results show that the throughput rates of AES-ECB, AES-CTR and AES-CBC in the system are 116.43 Gbps,60. 34 Gbps, and 4. 32 Gbps, respectively. The ECB mode compared with Intel Xeon E5-2650 V2 CPU and NVIDIA GeForce GTX 1080 GPU achieves 23.18 times and 1.43 times acceleration ratios respectively. Compared with the method just calling the CPU,the overall system has a computational acceleration ratio of 4.72. [ABSTRACT FROM AUTHOR]

In order to effectively solve the problems of multimedia data security and copyright protection in the process of transmission and storage, this paper proposed a commutative encryption and watermarking algorithm based on Zu Chongzhi(ZUC) stream cipher algorithm and DWT-SVD. Based on the invariance of the singular value, the algorithm embedded the watermark into the singular value, and used the ZUC algorithm to permutate and encrypt the set of the singular value matrix and the set of the singular matrix respectively. The sequence of embedding operation and encryption operation did not affect the generation of the watermarked ciphertext, meanwhile, both watermarked ciphertext and decrypted plaintext can extract watermark completely. The experimental results show that the watermark has good invisibility, and the algorithm has high security and a certain robustness. [ABSTRACT FROM AUTHOR]

Commutative encryption and watermarking ( CEW) is a combination of cryptographic and digital watermarking technology, which is used for multimedia information security and copyright protection. In order to ensure the security of carrier data, this paper proposed an exchange encryption watermarking algorithm based on ZUC. The algorithm used the ZUC sequence cipher to generate the key and used modular operation to encrypt the carrier information. The sequence of watermark embedding operation and data encryption operation did not affect the generation of watermark ciphertext data. When extracting the watermark, the algorithm could realize the exchange of password operation and watermark operation. The experimental results show that the watermark extraction in ciphertext domain is consistent with that in plaintext domain, the image containing watermark is of high quality, the efficiency of encryption and decryption, watermark embedding and extraction are higher, and the algorithm has a certain robustness. [ABSTRACT FROM AUTHOR]

In order to solve the weakness of existing medial image encryption algorithm based on chaotic system in considering the image' s texture feature, this paper proposed a medical image encryption and decryption method based on chaotic mapping and adaptive partitioning. Firstly, it used the 2D Sine Logistic chaotic system to generate two secure sequences with good chaotic characteristics . Then, it divided the original medical image into fixed size image blocks, and calculated their maximum pixel difference and variance . According to the given threshold, it divided these image blocks into texture smooth blocks and texture complex blocks. Finally, it used the first chaotic sequence with ciphertext feedback mechanism to encrypt the smooth blocks, and encrypt the complex blocks by using the second chaotic sequence with plaintext feedback mechanism. Therefore, it obtained the encrypted image. Because the presented algorithm efficiently considered the texture characteristics of image blocks and optimized the algorithm of chaotic encryption, it improved the encryption and decryption efficiency of medical images. Experimental simulation results show that the presented algorithm has high security and encryption efficiency. Compared with the existent method, it reduces the encryption and decryption time by about 0. 5 times . The presented algorithm is suitable for real-time medical images encryption and decryption with big data size. [ABSTRACT FROM AUTHOR]

Aiming at the shortage of medical images encryption algorithm in efficiency and security, this paper proposed a novel medical image encryption algorithm in frequent domain based on 2D sine Logistic chaotic mapping. Firstly, the proposed algorithm used the integer wavelet transform of LeGall5/3 to transform medical image from frequent domain to spatial domain. In this way, the high correlation among pixels has disappeared. Then, the proposed algorithm utilized 2D sine logistic chaotic mapping to generate the chaotic sequences. In order to improve the encryption efficiency, this algorithm chose the low frequency coefficients of three-level decomposed to encrypt with chaotic diffusion and scrambling mechanism. In the same time, this algorithm also selected the medium-high frequency coefficients of two-level decomposed to encrypt by chaotic diffusion mechanism for solving the problem of obvious outline in encrypted image. Finally, this algorithm transformed the encrypted wavelet coefficients by the inverse integer wavelet transform and obtained the encrypted image. Experimental simulation results demonstrate that the proposed algorithm is able to protect medical images with low time complexity and a high security level. Compared with the existing spatial method, it reduces the encryption time by about 0.025 times. In addition, the proposed algorithm has better image imperceptibility as well as an excellent encryption efficiency compared to the existing frequent method. [ABSTRACT FROM AUTHOR]

In order to solve the shortcomings of the traditional serial encryption method in single machine mode, such as the low density of data security, the difficulty in encrypting-efficiency to meet the requirement of increasing information data encryption and the excessive amount of memory in the running process, and so on. This paper designed a scheme of chaotic encryption algorithm based on Hadoop platform. The scheme used MapReduce parallel framework, chaotic encryption pseudorandom number and the principle of initial value sensitivity. And it proposed parallel chaotic encryption scheme for MapReduce framework and chaotic encryption optimization. It used the length of the plaintext as the initial value, and used Chen, Lorenz, Rossler chaotic system to generate secret key. At the same time, the paper proposed an idea of dividing plaintext data into blocks according to 1 MB. According to the offset, it judged each block to gene rate three key sequences of Chenn Lorenzi R0ssler whose length is 1 MB, to improve the security of data density, and reduce the amount of running memory and other purposes. This design framework used Chen sequence for plaintext messing operation, used Lorenz sequence for XOR diffusion ope ration and used Rössler sequence for modular auxiliary diffusion operation. Experiments prove that, for MapReduce, the optimization algorithm of using parallel framework and chaotic system can effectively reduce the amount of memory and improve the encryption speed, and the encryption ope ration associated with plaintext achieves the purpose of effectively defending against the attack of selected plaintext. [ABSTRACT FROM AUTHOR]

In the traditional attribute-based encryption scheme, there are problems that the attributes contained in the access policy may leak sensitive information of the user and the malicious user leaks the private key to gain illegal profits without being blamed. At the same time, with the increasing of the number of attributes the length of the private key, ciphertext, and the decryption operation will increase and it bring greater communication overhead and computational overhead. To solve these problems, this paper proposed an attribute-based encryption scheme that can track keys and hide the access structure. The scheme improved the security of the encryption algorithm without affecting the efficiency of encryption and decryption. The scheme adopted a two -factor authentication mechanism to achieve more secure and efficient access control, and it used a secure signature mechanism for supporting traceable keys to track malicious users. Finally, the theoretical analysis show that this scheme proved to be safe under the standard model based on the DBDH hypothesis. [ABSTRACT FROM AUTHOR]

The design of efficient and secure lattice-based post quantum key exchange protocols has certain practical and theoretical significance. This paper proposed a scheme used straight-forward transformation LWE encryption mechanism and a ciphertext compression technology. This was a passively secure and practical key exchange protocol. Frodo was a key exchange scheme based on LWE problem proposed by Bos et al. which used the error reconciliation mechanism proposed by Peikert. The main advantage of the scheme over Frodo was simplicity. Compared with Frodo. the communications traffic merely increased by only 1.09%. reduced the complexity of the scheme effectively. It proved scheme to be passive security. which could resist quantum computer attacks. Compared with existing key exchange protocol based on learning with error, this protocol is very competitive. [ABSTRACT FROM AUTHOR]

The problem of leaking through express sheet brings security risks to individuals, but also restricts the rapid development of express enterprises. This paper studied the privacy protection of express sheet. By combining the identity based encryption system (BF-IBE), the idea of authority design and the two-dimensional code technology, this paper designed a block encryption scheme. The scheme used a new private key distribution protocol (IC protocol) to solve the key management problem. This paper applied the block encryption scheme to the domain of express privacy protection, and designed a new privacy express sheet and express business process. The results show that the IC protocol uses in the block encryption scheme needs no inverse operation, and the bilinear pairings can be effectively reduced and the key management can be carried out easily. The encryption and decryption efficiency of the block encryption scheme is similar to that of BF-IBE. Its security is based on the discrete logarithm problem on elliptic curves. It can be applied to express field, which can effectively protect the user’s privacy. It is also suitable for other areas with block encryption requirements. [ABSTRACT FROM AUTHOR]

In order to achieve greater safety in RSA encryption algorithm in the data encryption process, this paper made some improvements based on in-depth analysis on the traditional RSA algorithm. It put forward a more secure method with changing traditional double primes into four primes in the traditional RSA algorithm and eliminating the requirement for transferring the product n of two random primes in public key on the basis of parameter substitution. Instead, this paper replaced the original parameter n to a new introduced parameter x. In order to boost the efficiency in the introduced algorithm, this paper used the CRT(Chinese remainder theorem) to expedite the exponentiation of large numbers. The results demonstrate the feasibility of the improved algorithm, and it provides a safer path for messages transmission through public key encryption. At the same time, this paper carried out a comparative analysis of encryption and decryption time among the improved algorithm and the traditional double primes and four primes RSA algorithms. The results show that the improved algorithm to a certain degree enhanced the encryption and decryption efficiency between the message sender and receiver. [ABSTRACT FROM AUTHOR]

Timed-release encryption( TRE) is a cryptography that studies the problem of sending information into the future,it can solve many practical problems to construct a feasible and safe TRE. This paper proposed a scheme based on the research of indistinguishability obfuscation and TRE. This scheme encapsulated the sender’s encryption and receiver’s decryption by a circuit and obfuscated this circuit by an indistinguishability obfuscator. It could make great use of the time of obfuscators obfuscate circuits,simplified the scheme and improved the security of this scheme. Finally,this paper proves the correctness and security of this TRE scheme. [ABSTRACT FROM AUTHOR]

This paper used dynamic time warping( DTW) algorithm to align side channel signals in differential power analysis( DPA) attacks. Based on the principle of DTW algorithm which produced a warp path for recomposing signal traces pair,it proposed a flexible alignment method. The practical experiments based on simulated misalignment signals obtained from a microcontroller( AT89C52) which implemented the data encryption standard( DES) cipher in software and inserted the random time delays. As the results show,running DPA on misaligned traces requires a much larger trace set when misalignment is appreciably increased,in contrast,performing DPA on the traces modified by flexible alignment can make it very low-cost in terms of the number of traces that need to be processed. The result also confirms the effectiveness of method mentioned above. [ABSTRACT FROM AUTHOR]

In order to solve the problems of data redundancy and low delivery ratio in DSNC algorithm,this paper proposed a routing algorithm for DTN based on dynamic segmented network coding and transmission capacity control( NC-TCC). It used the AONT matrix to encode the data at the source node of the network to avoid redundant coding. At the intermediate nodes,it calculated the transfer capacity of opportunistic connection according to the mobile model of nodes. While the encoded packets did not exceed the transfer capacity it selected the data with higher priority for random coding. This method was easy to achieve the successful transmission of data. Simulation results show that the algorithm can effectively reduce the data redundancy and improve the efficiency of data transmission. [ABSTRACT FROM AUTHOR]

Aiming at the differential power attack of the encryption scheme based on lattice, Reparaz proposed an additively homomorphic R-LWE masking scheme in PQC 2016. This scheme could against the differential power attack effectively, but the additively homomorphic algorithm between the ciphertexts made the size of noise increase. It declined the rate of decryption correctness. In view of this problem, this paper proposed an improved R-LWE homomorphic masking scheme. By introducing the modular switching technology, it made a modular reduction with the cipher text of additively homomorphic. Under the premising that plaintext and the ciphertext were corresponding, it declined the size of noise in the ciphertext. And it could improve the decryption correctness of the scheme. In order to protect the sub keys, it introduced a random matrix to mask the sub key. And it made the correctness analysis and the safety proof. The proposed scheme has better security and efficiency compared to the original scheme. [ABSTRACT FROM AUTHOR]

As data communication and user privacy security problems during wireless body area network (WBAN) combining with the cloud computing, this paper proposed multi-valued and ambiguous scheme (MAS) to solve the WBAN cloud data security issues. Firstly, it introduced an overview of MAS algorithm with the encryption and reasoning processes. Then, it applied this algorithm to solve the WBAN cloud data security issues, and that the algorithm could effectively guarantee the security of data communication between the cloud and it proved the WBAN. In addition, combined with existing encryption algorithms, it achieved an example of this algorithm. Finally, testde the efficiency of the proposed method. The experimental results show that as the input data from 0 to 900 KB, the total time of encryption of this algorithm has been kept within 5 s, lower than DES’s and AES’s. The total time of decryption has been kept within 22, which are also lower than DES’s and AES’s. This indicates that proposed algorithm can be applied into settling the data security problem of WBAN. [ABSTRACT FROM AUTHOR]

AES is the mainstream encryption algorithm now. This paper studied that AES implementation had less area and high throughout rate. According to the characteristics of the substitution, S-box transformation used 16 x 16 pre-stored permutation table so that lookup efficiency space could be achieve 0(1). All the galois field elements 2 times were stored in a table the first. All of the computing needed only look-up table and addition. This was to avoid the finite field multiplication and effectively reduce the number of operations. Key expansion was independent of the encryption algorithm itself. It used positive edge of the clock to control key generation. It could send key at the falling edge of the same clock cycle. This could make the area optimized and achieve high throughput rate without waiting for the arrival of the next clock edge. It controlled the rounds of calling encryption function by counter. Each module could also be called multiple times so that the encryption chip area was reduced. Experiments show that the area of optimized AES occupies 11 163 Slices. It is decreased by 2 times compared to 20 173 Slices of original AES. [ABSTRACT FROM AUTHOR]

To meet the watermarking requirement in encrypted domain, this paper proposed a novel reversible watermarking algorithm in histogram difference domain for encrypted image by utilizing a combination of histogram shifting and homomorphic encryption. It could embeded a watermark into the encrypted image directly to realize the process of plain image-encrypted image-watermark embedding, which simplified the traditional redundant process of plain image-encrypted image-decryption--watermark embedding-encryption again. Simulation experimental results demonstrate that the proposed algorithm can provide greater payload capacity and higher image fidelity. After it extracts the watermark completely, it can recover the original image reversibly. It outperforms other related algorithms. [ABSTRACT FROM AUTHOR]

To synchronize image compression and encryption, on the basis of further research of MQ arithmetic encoder, this paper regarded the random sequence generated by Lorenz chaos system as flow key to modify context and decision which came into being in the process of bit plane coding of JPEG2000 compression algorithm. It changed the probability distribution of decision when MQ coding, which changed the output stream, and realized the image joint compression encryption in this way. It elaborated the rule of the context modification and the decision modification algorithm. The simulation results indicate that the proposed algorithm doesn't influence the compression efficiency compared with the original compression algorithm. What's more, it has high security and instantaneity. [ABSTRACT FROM AUTHOR]

The key encryption methods can't guarantee the key distribution security. To overcome the above limitations, this paper proposed an encryption scheme over fading channels based on independency of channel phase response. Firstly, the paper divided the channel between the sender and the eavesdropper into the cascade of the two channeled, and calculated the key security capacity. Secondly, the paper discussed the discrete source PSK encryption parameters. Finally, the legitimate users could guarantee the system security. Simulation results show that, the error rate is rapidly increased to 0.5 with the estimation error of the received signal phase is 0.001. [ABSTRACT FROM AUTHOR]

The large integer factorization is not only the most direct attacking method against RSA asymmetric encryption algorithm, but also the most important point to analyze the security of RSA. Study on the large integer factorization problem is of great value for theory and practice. TH paper summarized the study on of the large integer factorization problem and reviewed modern popular integer factorization algorithms, and introduced their basic principle and implementation steps. In addition, this paper made an analysis on existing large integer factorization techniques' advantage and disadvantage of implementation ad application. At last, this paper stated the future prospect of large integer factorization. [ABSTRACT FROM AUTHOR]