搜索结果: 1-15 共查到“characteristic”相关记录290条 . 查询时间(0.109 秒)
This is a periodic series learning seminar organized by Koji Shimizu and Shizhang Li on prismatic F-gauges held on each Monday at MCM110. More info can be found on the website.
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Syntomic cohomology in characteristic p
特征p 同调 Syntomic cohomology
2023/4/13
Discuss [Bha, §4.4-4.5]. One reasonable plan is to focus on §4.5 and use it as motivation to introduce materials in §4.4.
This is a periodic series learning seminar organized by Koji Shimizu and Shiz...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Syntomification in characteristic p
特征p 同义化 棱镜F规
2023/4/13
Discuss [Bha, §4.1-4.3]. Introduce Definitions 4.1.1 & 4.2.1, and mention (some of) their properties buried in the remarks; then discuss Example 4.2.6, Proposition 4.3.1, Example 4.3.3, Definition 4.3...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：The de Rham cohomology in characteristic 0
特征0 德拉姆 上同调
2023/4/19
Discuss [Bha, §2.3-2.4]. See [Dri20, §1.3] for the notion of cones and quasi-ideals. Note that some of the remarks (e.g. Remark 2.2.15) [Bha, §2.2] may not have been covered in Lecture 1. Explain them...
长安大学电子与控制工程学院自动控制原理英文课件Chapter 04 Feedback Control System Characteristic
长安大学电子与控制工程学院 自动控制原理 英文课件 Control System Characteristic
2020/1/8
长安大学电子与控制工程学院自动控制原理英文课件Chapter 04 Feedback Control System Characteristic。
Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
discrete logarithm problem finite field
2019/6/26
We prove that the discrete logarithm problem can be solved in quasi-polynomial expected time in the multiplicative group of finite fields of fixed characteristic. More generally, we prove that it can ...
TRIFLE is a Round 1 candidate of the NIST Lightweight Cryptography Standardization process. In this paper, we present an interesting 1-round iterative differential characteristic of the underlying blo...
Faster Initial Splitting for Small Characteristic Composite Extension Degree Fields
Discrete Log Finite fields Function Field Sieve Cryptography
2019/3/21
Let pp be a small prime and n=n1n2>1n=n1n2>1 be a composite integer. For the function field sieve algorithm applied to FpnFpn, Guillevic (2019) had proposed an algorithm for initial splitting of the t...
THE MONITORING AND SPATIAL-TEMPORAL EVOLUTION CHARACTERISTIC ANALYSIS FOR LAND SUBSIDENCE IN BEIJING
Land Subsidence D-InSAR Small Baseline Subset (SBAS) Characteristic Analysis Plain area
2018/5/17
At present the land subsidence has been the main geological disaster in the plain area of China, and became one of the most serious disaster that restrict the social and economic sustainable developme...
2018 Workshop on Expected Characteristic Polynomial Techniques and Applications
2018 Workshop Expected Characteristic Polynomial Techniques and Applications
2017/12/20
A central goal of the program is to further connections between problems in infinite and finite dimensioQLAWS1_imagenal linear algebra. This workshop will focus on the expected characteristic polynomi...
Improved Attacks for Characteristic-2 Parameters of the Cubic ABC Simple Matrix Encryption Scheme
multivariate public key cryptography differential invariant MinRank
2017/3/6
In the last few years multivariate public key cryptography has experienced an infusion of new ideas for encryption. Among these new strategies is the ABC Simple Matrix family of encryption schemes whi...
Montgomery curves and their arithmetic: The case of large characteristic fields
Montgomery curve Montgomery ladder elliptic curve cryptography
2017/3/6
Three decades ago, Montgomery introduced a new elliptic curve model for use in Lenstra's ECM factorization algorithm. Since then, his curves and the algorithms associated with them have become foundat...
Impossible differential attack is one of powerful methods for analyzing encryption algorithms. When designing cryptographic algorithms, it must be safe for impossible differential attacks. In case of ...
Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
discrete logarithm problem bilinear pairings cryptanalysis, implementation
2016/12/9
Since 2013 there have been several developments in algorithms for computing discrete logarithms in small-characteristic finite fields, culminating in a quasi-polynomial algorithm. In this paper, we re...
Automatic Search for a Maximum Probability Differential Characteristic in a Substitution-Permutation Network
Block ciphers Cryptanalysis
2016/6/27
The algorithm presented in this paper computes a maximum probability differential characteristic in a Substitution-Permutation Network (or SPN). Such characteristics can be used to prove that a cipher...