Diffusion-Weighted Imaging (DWI) is a significant technique for studying white matter. However, it suffers from low-resolution obstacles in clinical settings. Post-acquisition Super-Resolution (SR) can enhance the res...
详细信息
INTRODUCTION With the breakdown of Dennard’s scaling rule,chip power for a given area size is not constant as transistors shrink from generation to generation[1].In particular,the power wall problem worsens with the ...
详细信息
INTRODUCTION With the breakdown of Dennard’s scaling rule,chip power for a given area size is not constant as transistors shrink from generation to generation[1].In particular,the power wall problem worsens with the continual improvement in
Privacy protection is the key to maintaining the Internet of Things(IoT)communication *** is an important way to achieve covert communication that protects user data *** technology is the key to checking steganography...
详细信息
Privacy protection is the key to maintaining the Internet of Things(IoT)communication *** is an important way to achieve covert communication that protects user data *** technology is the key to checking steganography security,and its ultimate goal is to extract embedded *** methods cannot extract under known cover *** this end,this paper proposes a method of extracting embedded messages under known cover ***,the syndrome-trellis encoding process is ***,a decoding path in the syndrome trellis is obtained by using the stego sequence and a certain parity-check matrix,while the embedding process is simulated using the cover sequence and parity-check *** the decoding path obtained by the stego sequence and the correct parity-check matrix is optimal and has the least distortion,comparing the path consistency can quickly filter the coding parameters to determine the correct matrices,and embedded messages can be extracted *** proposed method does not need to embed all possible messages for the second time,improving coding parameter recognition *** experimental results show that the proposed method can identify syndrome-trellis coding parameters in stego images embedded by adaptive steganography quickly to realize embedded message extraction.
Due to advances in semiconductor techniques, many-core processors have been widely used in high performance computing. However, many applications still cannot be carried out efficiently due to the memory wall, which h...
详细信息
Due to advances in semiconductor techniques, many-core processors have been widely used in high performance computing. However, many applications still cannot be carried out efficiently due to the memory wall, which has become a bottleneck in many-core processors. In this paper, we present a novel heterogeneous many-core processor architecture named deeply fused many-core （DFMC） for high performance computing systems. DFMC integrates management processing ele- ments （MPEs） and computing processing elements （CPEs）, which are heterogeneous processor cores for different application features with a unified ISA （instruction set architecture）, a unified execution model, and share-memory that supports cache coherence. The DFMC processor can alleviate the memory wall problem by combining a series of cooperative computing techniques of CPEs, such as multi-pattern data stream transfer, efficient register-level communication mechanism, and fast hardware synchronization technique. These techniques are able to improve on-chip data reuse and optimize memory access performance. This paper illustrates an implementation of a full system prototype based on FPGA with four MPEs and 256 CPEs. Our experimental results show that the effect of the cooperative computing techniques of CPEs is significant, with DGEMM （double-precision matrix multiplication） achieving an efficiency of 94%, FFT （fast Fourier transform） obtaining a performance of 207 GFLOPS and FDTD （finite-difference time-domain） obtaining a performance of 27 GFLOPS.
Task execution for object rearrangement could be challenged by Task-Level Perturbations (TLP)—unexpected object additions, removals, and displacements—that can disrupt underlying visual policies and fundamentally co...
详细信息
PRIDE is a lightweight block cipher proposed at CRYPTO 2014 by Albrecht et al., who claimed that the construction of linear layers is efficient and secure. In this paper, we investigate the key schedule and find eight...
详细信息
PRIDE is a lightweight block cipher proposed at CRYPTO 2014 by Albrecht et al., who claimed that the construction of linear layers is efficient and secure. In this paper, we investigate the key schedule and find eight 2-round iterative related-key differential characteristics, which can be used to construct 18-round related-key differentials. A study of the first subkey derivation function reveals that there exist three weak-key classes, as a result of which all the differences of subkeys for each round are identical. For the weak-key classes,we also find eight 2-round iterative related-key differential characteristics. Based on one of the related-key differentials, we launch an attack on the full PRIDE block cipher. The data and time complexity are 2;chosen plaintexts and 2;encryptions, respectively. Moreover, by using multiple related-key differentials, we improve the cryptanalysis, which then requires 2;chosen plaintexts and 2;encryptions, respectively. Finally, we use two 17-round related-key differentials to analyze full PRIDE, which requires 2;plaintexts and 2;*** are the first results on full PRIDE, and show that the PRIDE block cipher is not secure against related-key differential attack.
Let P(t) be a product of(possibly repeated) linear factors over Q and K/Q an abelian extension. Under a strict condition, we show that the Brauer-Manin obstruction to the Hasse principle and weak approximation is the ...
详细信息
Let P(t) be a product of(possibly repeated) linear factors over Q and K/Q an abelian extension. Under a strict condition, we show that the Brauer-Manin obstruction to the Hasse principle and weak approximation is the only one for any smooth proper model of the variety over Q defined by P(t) = NK/Q(x).
At present, steganalysis research focuses on detecting the existence of a hidden message. However,extracting the hidden information, i.e., an extracting attack, is crucial in obtaining effective evidence in computer f...
详细信息
At present, steganalysis research focuses on detecting the existence of a hidden message. However,extracting the hidden information, i.e., an extracting attack, is crucial in obtaining effective evidence in computer forensics. Due to the difficulty of an extracting attack, research in this field is limited. In steganography with a stego key, an extracting attack is equivalent to recovering the stego key. In this paper we study a method for recovering the stego key in least significant bit(LSB) steganography with a decompressed JPEG image as the cover image. Firstly, the recovery of the stego key is translated into a cryptanalysis problem for a sequential cipher. The method for recovering the stego key is based on estimating the modification positions. The minimum size of the data used to recover the stego key successfully is discussed. Secondly, when a decompressed JPEG image is used as the cover image, the probability of recovering the cover pixels using recompression is *** is used to compute the error of the estimated sequence. Finally, an algorithm to recover the stego key in LSB steganography with a decompressed JPEG image as the cover image is proposed. The experimental results for the steganographic software, Hide and Seek 4.1 and its variant, which is a typical representative of LSB steganography, show that the proposed method can successfully recover the stego key in LSB replacement and LSB matching, i.e., the extracting attack is successful, and it outperforms three previous methods in terms of computational complexity.
In recent years,the rapid development of computer software has led to numerous security problems,particularly software *** flaws can cause significant harm to users’privacy and *** security defect detection technolog...
详细信息
In recent years,the rapid development of computer software has led to numerous security problems,particularly software *** flaws can cause significant harm to users’privacy and *** security defect detection technology relies on manual or professional reasoning,leading to missed detection and high false detection *** intelligence technology has led to the development of neural network models based on machine learning or deep learning to intelligently mine holes,reducing missed alarms and false ***,this project aims to study Java source code defect detection methods for defects like null pointer reference exception,XSS(Transform),and Structured Query Language(SQL)***,the project uses open-source Javalang to translate the Java source code,conducts a deep search on the AST to obtain the empty syntax feature library,and converts the Java source code into a dependency *** feature vector is then used as the learning target for the neural *** types of Convolutional Neural Networks(CNN),Long Short-Term Memory(LSTM),Bi-directional Long Short-Term Memory(BiLSTM),and Attention Mechanism+Bidirectional LSTM,are used to investigate various code defects,including blank pointer reference exception,XSS,and SQL injection *** results show that the attention mechanism in two-dimensional BLSTM is the most effective for object recognition,verifying the correctness of the method.
NTRU is one of the most widely used public-key cryptosystems and its security has been an active research *** paper proposes a new way to find NTRU-2005 private *** algorithm is based on meet-in-the-middle attack and ...
详细信息
NTRU is one of the most widely used public-key cryptosystems and its security has been an active research *** paper proposes a new way to find NTRU-2005 private *** algorithm is based on meet-in-the-middle attack and a quantum algorithm for searching the fixed weight *** with the current classical and quantum meet-in-the-middle attacks,our algorithm has lower time and space ***,this attack can also be applied against different versions of *** result can help to understand the security of NTRU better.
暂无评论