Optimizing cc-sum BKW and Faster Quantum Variant for LWE

The Learning with Errors (LWE) problem has become one of the most prominent candidates of post-quantum cryptography, offering promising potential to meet the challenge of quantum computing. From a theoretical perspective, optimizing algorithms to solve LWE is a vital task for the analysis of this cryptographic primitive. In this paper, we propose a fine-grained time/memory trade-off method to analyze c-sum BKW variants for LWE in both classical and quantum models, then offer new complexity bounds for multiple BKW variants determined by modulus q, dimension k, error rate alpha, and stripe size b. Through our analysis, optimal parameters can be efficiently found for different settings, and the minimized complexities are lower than existing results. Furthermore, we enhance the performance of c-sum BKW in the quantum computing model by adopting the quantum Meet-in-the-Middle technique as c-sum solver instead of the naive c-sum technique. Our complexity trade-off formula also applies to the quantum version of BKW, and optimizes the theoretical quantum time and memory costs, which are exponentially lower than existing quantum c-sum BKW variants. </p

Text-Queried Target Sound Event Localization

Sound event localization and detection (SELD) aims to determine the appearance of sound classes, together with their Direction of Arrival (DOA). However, current SELD systems can only predict the activities of specific classes, for example, 13 classes in DCASE challenges. In this paper, we propose text-queried target sound event localization (SEL), a new paradigm that allows the user to input the text to describe the sound event, and the SEL model can predict the location of the related sound event. The proposed task presents a more user-friendly way for human-computer interaction. We provide a benchmark study for the proposed task and perform experiments on datasets created by simulated room impulse response (RIR) and real RIR to validate the effectiveness of the proposed methods. We hope that our benchmark will inspire the interest and additional research for text-queried sound source localization.Comment: Accepted by EUSIPCO 202

Implicit Factorization with Shared Any Bits

At PKC 2009, May and Ritzenhofen proposed the implicit factorization problem (IFP). They showed that it is undemanding to factor two h-bit RSA moduli N1=p1q1, N2=p2q2 where q1, q2 are both αh-bit, and p1, p2 share uh&gt;2αh the least significant bits (LSBs). Subsequent works mainly focused on extending the IFP to the cases where p1, p2 share some of the most significant bits (MSBs) or the middle bits (MBs). In this paper, we propose a novel generalized IFP where p1 and p2 share an arbitrary number of bit blocks, with each block having a consistent displacement in its position between p1 and p2, and we solve it successfully based on Coppersmith’s method. Specifically, we generate a new set of shift polynomials to construct the lattice and optimize the structure of the lattice by introducing a new variable z=p1. We derive that we can factor the two moduli in polynomial time when u&gt;2(n+1)α(1−α^1/(n+1)) with p1, p2 sharing n blocks. Further, no matter how many blocks are shared, we can theoretically factor the two moduli as long as u&gt;2αln(1/α). In addition, we consider two other cases where the positions of the shared blocks are arbitrary or there are k&gt;2 known moduli. Meanwhile, we provide the corresponding solutions for the two cases. Our work is verified by experiments. </p

An Efficient Anonymous Authentication Scheme for Mobile Pay-TV Systems

As a component of mobile communication, the pay-TV system has attracted a lot of attention. By using mobile devices, users interact with the head end system in service providers to acquire TV services. With the growth of mobile users, how to protect the privacy of users while improving efficiency of the network has become an issue worthy of attention. Anonymous authentication schemes for mobile pay-TV systems came into being. In this paper, we analyze the shortcomings of the existing authentication protocol and then propose an improved one, which is secure against stored set attack and user traceability attack. The proposed scheme is proved to be secure. Moreover, our new scheme performs better in efficiency and storage, compared with several other schemes.</jats:p

Efficiency Analysis of the Input for Water-Saving Agriculture in China

To optimize the installation distribution of water-saving techniques and improve the efficiency of water-saving agricultural inputs, we used a three-stage data envelopment analysis (DEA) model and Chinese provincial panel data from 2014 to 2016 to analyze the input efficiency of the water-saving irrigation. This study explores the efficiency derived from the efforts of water-saving initiatives in the agricultural sector in China. We present the impacts of factors such as technology, scale, diminishing marginal revenue, and crop water requirements on the research results. We found overall efficiency of water-saving irrigation is increasing nationally. The efficiency of water-saving irrigation input will significantly increase if management and organization of the input improve. Increasing the investment in areas with increasing marginal revenue would improve the local agricultural water-saving input efficiency in areas such as Hainan, Chongqing, Guizhou, Tibet, and Qinghai; although in areas with large water requirement for major crops, such as Inner Mongolia and Xinjiang, the efficiency of water-saving irrigation is generally high. Shanxi requires a large amount of water as the efficiency of agricultural water-saving input is 0.07, which is relatively lower than the average efficiency of all regions (0.39). The cultivated area index and the GDP per capita had no significant effect on the irrigation input efficiency.</jats:p

Mechanism of Coal Burst Triggered by Mining-Induced Fault Slip Under High-Stress Conditions: A Case Study

Coal burst disaster is easily triggered by mining-induced fault unloading instability involving underground engineering. The high-static stress environment caused by complex geological structures increases the difficulty in predicting and alleviating such geological disasters caused by humans. At present, the mechanism of coal burst induced by mining-induced slip fault under high-stress conditions still cannot be reasonably explained. In this study, the burst accidents occurring near mining-induced slip fault under high-stress conditions were carefully combined, and the “time–space–intensity” correlation of excavation, fault, and syncline and anticline structure of the mining areas was summarized. On this basis, the rotation characteristics of the main stress field of the fault surface subjected to mining under high-stress conditions and the evolution law of stress were analyzed. Last, based on the spectrum characteristics of mining-induced tremors, the first motion of the P-wave, and the ratio of Es/Ep, the source mechanism behind mining-induced fault slip under high-stress conditions was revealed. The results demonstrate that the coal burst triggered by the fault slip instability under high-stress conditions is closely related to the excavation disturbance and the fold structure. Mining activities trigger the unloading and activation of the discontinuous structural surface of the fault, the rotation of the stress field, and the release of a large amount of elastic strain energy and cause dynamic disasters such as coal bursts. The research results in this study are helpful to enrich the cognition of the inducing mechanism of fault coal burst.</jats:p