Radar studies of turbulence and lidar studies of the nickel layer in the Arctic mesosphere

Thesis (M.S.) University of Alaska Fairbanks, 2016This thesis presents studies of the Arctic middle atmosphere using Incoherent Scatter Radar (ISR) and resonance lidar at Poker Flat Research Range (PFRR), Chatanika, Alaska. The Poker Flat Incoherent Scatter Radar (PFISR) provides measurements of mesospheric turbulence and the resonance lidar provides measurements of mesospheric nickel layer. We develop retrieval and analysis techniques to determine the characteristics of the turbulence and the nickel layer. We present measurements of mesospheric turbulence with PFISR on 23 April 2008 and 18 February 2013. We characterize mesospheric turbulence in terms of the energy dissipation rate as a function of altitude and time on these days. We present an extensive analysis of the radar measurements to show that the use of high quality PFISR data and an accurate characterization of the geophysical conditions are essential to achieve accurate turbulent measurements. We find that the retrieved values of the energy dissipation rate vary significantly based on how the data is selected. We present measurements of mesospheric nickel layer with resonance lidar on the night of 27-28 November 2012 and 20-21 December 2012. We characterize the mesospheric nickel layer in terms of the nickel concentration as a function of altitude on these days. We find that our nickel concentrations are significantly higher than expected from studies of meteors. We present an extensive analysis of the lidar measurements to show that these measurements of unexpectedly high values of the nickel concentrations are accurate and not biased by the lidar measurements.Chapter 1: Introduction -- 1.1 The middle atmosphere -- 1.2 Wave breaking and turbulence -- 1.3 Radar detection of turbulence -- 1.4 Mesospheric metal layers -- 1.5 Scope of this study -- Chapter 2: Theory of ISR turbulence measurements -- 2.1 Turbulence -- 2.2 Radar measurement technique -- 2.3 The Poker Flat Incoherent Scatter Radar -- Chapter 3: ISR measurements of turbulence -- 3.1 Fitting method and spectral model -- 3.2 PFISR measurements on 23 April 2008 -- 3.3 PFISR measurements on 18 February 2013 -- 3.4 Conclusion -- Chapter 4: Lidar measurement of mesospheric nickel layer -- 4.1 Lidar experiment and observations -- 4.2 Identification of nickel signal -- 4.3 Determination of nickel concentration -- 4.4 Discussion and conclusions -- Chapter 5: Summary and future work -- 5.1 PFISR measurement of turbulence in the mesosphere -- 5.2 Lidar measurements of nickel in the mesosphere -- Reference

Lidar and radar studies of turbulence, instabilities, and waves in the Arctic middle atmosphere

Thesis (Ph.D.) University of Alaska Fairbanks, 2019This dissertation presents new studies of gravity waves and turbulence in the Arctic middle atmosphere. The studies employ lidars and radar to characterize wave activity, instability and turbulence. In the lidar-based studies, we analyze turbulence and wave activity in the MLT based on lidar measurements of atmospheric temperature, density and sodium density, temperature and wind. This combination of measurements provides simultaneous characterization of both the atmospheric stability as well as material transport that allow us to estimate the eddy diffusion coefficient associated with turbulence. We extend the scope of previous studies by developing retrievals of potential temperature and sodium mixing ratio from the Rayleigh density temperature lidar and sodium resonance density lidar measurements. We find that the estimated values of turbulent eddy diffusion coefficients, K, of 400-2800 m²/s, are larger than typically reported (1-1000 m²/s) while the values of the energy dissipation rates, ε, of 5-20 mW/kg, are more typical (0.1-1000 mW/kg). We find that upwardly propagating gravity waves accompany the instabilities. In the presence of instabilities, we find that the gravity waves are dissipating as they propagate upward. We estimate the energy available for turbulence generation from the wave activities and estimate the possible turbulent energy dissipation rate, εGW. We find that the values of εGW are comparable to the values of ε. We find that the estimate of the depth of the layer of turbulence are critical to the estimate of the values of both ε and εGW. We find that our method tends to overestimate the depth, and thus overestimate the value of ε, and underestimate the value of εGW. In the radar-based study, we conduct a retrieval of turbulent parameters in the mesosphere based on a hypothesis test. We distinguish between the presence and absence of turbulence based on fitting Voigt-based and Lorentzian-based line shapes to the radar spectra. We also allow for the presence and absence of meteoric smoke particles (MSPs) in the radar spectra. We find examples of Poker Flat Incoherent Scatter Radar (PFISR) spectra showing both the presence and absence of turbulence and the presence and absence of MSPs in the upper mesosphere. Based on the analysis, we find that relatively few of the radar measurements yield significant measurements of turbulence. The significant estimates of turbulence have a strength that is over a factor of two larger than the average of the estimates from all of the radar measurements. The probability of true positives increases with the quality factor of the spectrum. The method yields significant measurements of turbulence with probabilities of true positives of greater than 30% and false positives less than 0.01%.National Science Foundation, Coupling Energetics and Dynamics of Atmospheric Regions (CEDAR) progra

Cryptanalysis of the SNOVA signature scheme

SNOVA is a variant of a UOV-type signature scheme over a noncommutative ring. In this article, we demonstrate that certain parameters provided by authors in SNOVA fail to meet the NIST security level, and the complexities are lower than those claimed by SNOVA

Analysis of Hall Anchor Pulling Force on Soft Soil Condition

Taking 60kg C Hall anchor as an example. We established the pulling anchor model on soft soil condition based on the theoretical formula and hall anchor simulation model in CEL analysis method of ABAQUS software. That got the pulling force in soft soil and the flow of soft soil. These results show that although the method of theoretical calculation can accurately calculate the pulling force, could not reflect the change of the pulling force with the change of the distance of pulling anchor, and could not assess the stability of the pulling force. In the results of numerical calculation, the pulling force in soft soil is a wave force. In the results of the flow of soft soil, the wave of the force in first 20 seconds is related to the concave pit in the initial formation of the anchor, in this stage, to avoid the slide of the anchor, the pulling speed and the pulling force should be controlled to reduce

Limitations of the Macaulay matrix approach for using the HHL algorithm to solve multivariate polynomial systems

Recently Chen and Gao~\cite{ChenGao2017} proposed a new quantum algorithm for Boolean polynomial system solving, motivated by the cryptanalysis of some post-quantum cryptosystems. The key idea of their approach is to apply a Quantum Linear System (QLS) algorithm to a Macaulay linear system over \CC, which is derived from the Boolean polynomial system. The efficiency of their algorithm depends on the condition number of the Macaulay matrix. In this paper, we give a strong lower bound on the condition number as a function of the Hamming weight of the Boolean solution, and show that in many (if not all) cases a Grover-based exhaustive search algorithm outperforms their algorithm. Then, we improve upon Chen and Gao's algorithm by introducing the Boolean Macaulay linear system over \CC by reducing the original Macaulay linear system. This improved algorithm could potentially significantly outperform the brute-force algorithm, when the Hamming weight of the solution is logarithmic in the number of Boolean variables. Furthermore, we provide a simple and more elementary proof of correctness for our improved algorithm using a reduction employing the Valiant-Vazirani affine hashing method, and also extend the result to polynomial systems over \FF_q improving on subsequent work by Chen, Gao and Yuan \cite{ChenGao2018}. We also suggest a new approach for extracting the solution of the Boolean polynomial system via a generalization of the quantum coupon collector problem \cite{arunachalam2020QuantumCouponCollector}.Comment: 27 page

Post-Quantum Secure Remote Password Protocol from RLWE Problem

Secure Remote Password (SRP) protocol is an augmented Password-based Authenticated Key Exchange (PAKE) protocol based on discrete logarithm problem (DLP) with various attractive security features. Compared with basic PAKE protocols, SRP does not require server to store user\u27s password and user does not send password to server to authenticate. These features are desirable for secure client-server applications. SRP has gained extensive real-world deployment, including Apple iCloud, 1Password etc. However, with the advent of quantum computer and Shor\u27s algorithm, classic DLP-based public key cryptography algorithms are no longer secure, including SRP. Motivated by importance of SRP and threat from quantum attacks, we propose a RLWE-based SRP protocol (RLWE-SRP) which inherit advantages from SRP and elegant design from RLWE key exchange. We also present parameter choice and efficient portable C++ implementation of RLWE-SRP. Implementation of our 209-bit secure RLWE-SRP is more than 3x faster than 112-bit secure original SRP protocol, 5.5x faster than 80-bit secure J-PAKE and 14x faster than two 184-bit secure RLWE-based PAKE protocols with more desired properties

PGformer: Proxy-Bridged Game Transformer for Multi-Person Extremely Interactive Motion Prediction

Multi-person motion prediction is a challenging task, especially for real-world scenarios of densely interacted persons. Most previous works have been devoted to studying the case of weak interactions (e.g., hand-shaking), which typically forecast each human pose in isolation. In this paper, we focus on motion prediction for multiple persons with extreme collaborations and attempt to explore the relationships between the highly interactive persons' motion trajectories. Specifically, a novel cross-query attention (XQA) module is proposed to bilaterally learn the cross-dependencies between the two pose sequences tailored for this situation. Additionally, we introduce and build a proxy entity to bridge the involved persons, which cooperates with our proposed XQA module and subtly controls the bidirectional information flows, acting as a motion intermediary. We then adapt these designs to a Transformer-based architecture and devise a simple yet effective end-to-end framework called proxy-bridged game Transformer (PGformer) for multi-person interactive motion prediction. The effectiveness of our method has been evaluated on the challenging ExPI dataset, which involves highly interactive actions. We show that our PGformer consistently outperforms the state-of-the-art methods in both short- and long-term predictions by a large margin. Besides, our approach can also be compatible with the weakly interacted CMU-Mocap and MuPoTS-3D datasets and achieve encouraging results. Our code will become publicly available upon acceptance

Comparison analysis and efficient implementation of reconciliation-based RLWE key exchange protocol

Error reconciliation is an important technique for Learning With Error (LWE) and Ring-LWE (RLWE)-based constructions. In this paper, we present a comparison analysis on two error reconciliation-based RLWE key exchange protocols: Ding et al. in 2012 (DING12) and Bos et al. in 2015 (BCNS15). We take them as examples to explain core idea of error reconciliation, building key exchange over RLWE problem, implementation, real-world performance and compare them comprehensively. We also analyse a LWE key exchange “Frodo” that uses an improved error reconciliation mechanism in BCNS15. To the best of our knowledge, our work is the first to present at least 128-bit classic (80-bit quantum) and 256-bit classic (>200-bit quantum) secure parameter choices for DING12 with efficient portable C/C++ implementations. Benchmark shows that our efficient implementation is 11x faster than BCNS15 and one key exchange execution only costs 0.07ms on a 4-year-old middle range CPU. Error reconciliation is 1.57x faster than BCNS15