搜索结果: 1-15 共查到“知识库 军事学 Root”相关记录27条 . 查询时间(0.156 秒)
ProtectIOn: Root-of-Trust for IO in Compromised Platforms
Compromised Platforms control systems
2019/7/31
Security and safety-critical remote applications such as e-voting, online banking, industrial control systems, medical devices, and home automation systems rely upon user interaction that is typically...
k-root-n: An efficient O(√n) algorithm for avoiding short term double spending in Distributed Ledger Technologies such as Blockchain
Blockchain bitcoin distributed ledger technology
2019/7/17
Blockchains such as bitcoin rely on reaching global consensus for the distributed ledger, and suffer from a well know scalability problem. We propose an algorithm which can avoid double spending in th...
Don't forget your roots: constant-time root finding over F2m
Side-channel Attack Post-quantum Cryptography Code-based Cryptography
2019/7/15
In the last few years, post-quantum cryptography has received much attention. NIST is running a competition to select some post-quantum schemes as standard. As a consequence, implementations of post-q...
Can we Beat the Square Root Bound for ECDLP over Fp2 via Representations?
ECDLP Square Root Bound
2019/7/15
We give a 4-list algorithm for solving the Elliptic Curve Discrete Logarithm (ECDLP) over some quadratic field Fp2Fp2. Using the representation technique, we reduce ECDLP to a multivariate polynomial ...
Integral Matrix Gram Root and Lattice Gaussian Sampling without Floats
Lattice based cryptography Discrete Gaussian sampling Matrix decomposition
2019/4/1
Many advanced lattice based cryptosystems require to sample lattice points from Gaussian distributions. One challenge for this task is that all current algorithms resort to floating-point arithmetic (...
Improved upper bound on root number of linearized polynomials and its application to nonlinearity estimation of Boolean functions
Boolean Functions Nonlinearity Linearized Polynomial Root Number
2018/12/3
To determine the dimension of null space of any given linearized polynomial is one of vital problems in finite field theory, with concern to design of modern symmetric cryptosystems. But, the known ge...
Ground-up Root-cause Analysis guided Low-Overhead Generic Countermeasure for Electro-Magnetic Side-Channel Attack
EM Side-channel attack generic countermeasure cryptographic hardware
2018/6/25
The threat of side-channels is becoming increasingly prominent for resource-constrained internet-connected devices. While numerous power side-channel countermeasures have been proposed, a promising ap...
We introduce a new type of Montgomery-like square root formulae in GF(2m)GF(2m) defined by an arbitrary irreducible trinomial, which is more efficient compared with classic square root operation. By c...
The closest vector problem in tensored root lattices of type A and in their duals
Lattice based cryptography Cyclotomic lattices Tensored root lattices
2016/12/9
The closest vector problem in tensored root lattices of type A and in their duals.
Remarks on the Pocklington and Padr?S醗z Cube Root Algorithm in $\mathbb F_q$
cube root algorithm finite field Pocklington algorithm
2016/1/25
We clarify and generalize a cube root algorithm in Fq proposed by Pocklington [1],
and later rediscovered by Padr磑 and S碼ez [2]. We correct some mistakes in [2] and give
a full generalization of the...
Providing Root of Trust for ARM TrustZone using On-Chip SRAM
TrustZone Trusted Execution Environment TPM Service
2016/1/9
We present the design, implementation and evaluation of the root of trust for the Trusted Execution Environment (TEE) provided by ARM TrustZone based on SRAM Physical Unclonable Functions (PUFs). We f...
Lightweight Diffusion Layer from the $k^{th}$ root of the MDS Matrix
MDS Matrix kth Root of a Matrix Lightweight Diffusion Layer
2016/1/8
The Maximum Distance Separable (MDS) mapping, used in cryptography deploys complex Galois field multiplications, which consume lots of area in hardware, making it a costly primitive for lightweight cr...
On r-th Root Extraction Algorithm in F_q For q=lr^s+1 (mod r^(s+1)) with 0 < l < r and Small s
r-th root algorithm finite field Adleman-Manders-Miller algorithm Cipolla-Lehmer algorithm
2013/4/18
We present an r-th root extraction algorithm over a finite field F_q. Our algorithm precomputes a primitive r^s-th root of unity where s is the largest positive integer satisfying r^s| q-1, and is app...
We present a square root algorithm in F_q which generalizes Atkins's square root algorithm for q=5(mod 8) and Kong et al.'s algorithm for q=9(mod 16) Our algorithm precomputes a primitive 2^s-th root ...
Trace Expression of r-th Root over Finite Field
applications / finite field r-th root linear recurrence relation
2013/2/21
Efficient computation of $r$-th root in $\mathbb F_q$ has many applications in computational number theory and many other related areas. We present a new $r$-th root formula which generalizes M\"{u}ll...