搜索结果: 1-15 共查到“军事学 GF-4”相关记录56条 . 查询时间(0.182 秒)
Yet Another Size Record for AES: A First-Order SCA Secure AES S-box Based on GF($2^8$) Multiplication
side-channel analysis Threshold Implementation AES
font style='font-size:12px;'>
2018/11/12
It is well known that Canright’s tower field construction leads to a very small, unprotected AES S-box circuit by recursively embedding Galois Field operations into smaller fields. The current size re...
4-bit crypto S-boxes: Generation with irreducible polynomials over Galois field GF(24) and cryptanalysis
public-key cryptography EPs
font style='font-size:12px;'>
2018/6/13
4-bit crypto S-boxes play a significant role in encryption and decryption of many cipher algorithms from last 4 decades. Generation and cryptanalysis of generated 4-bit crypto S-boxes is one of the ma...
Implementing Joux-Vitse's Crossbred Algorithm for Solving MQ Systems over GF(2) on GPUs
Post-quantum cryptography multivariate quadratic systems parallel implementation
font style='font-size:12px;'>
2017/12/11
The hardness of solving multivariate quadratic (MQ) systems is the underlying problem for multivariate-based schemes in the field of post-quantum cryptography. The concrete, practical hardness of this...
On Fast Multiplication in Binary Finite Fields and Optimal Primitive Polynomials over GF(2)
implementation multiplication modular reduction
font style='font-size:12px;'>
2017/9/18
In this paper we present a number of algorithms and optimization techniques to speedup computations in binary extension fields over GF(2). Particularly, we consider multiplication and modular reductio...
Multiplication and Division over Extended Galois Field GF(pqpq): A new Approach to find Monic Irreducible Polynomials over any Galois Field GF(pqpq).
Galois Field Finite field Irreducible Polynomials (IPs)
font style='font-size:12px;'>
2017/6/9
Irreducible Polynomials (IPs) have been of utmost importance in generation of substitution boxes in modern cryptographic ciphers. In this paper an algorithm entitled Composite Algorithm using both mul...
Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2)
Gate complexity linear systems dense matrices
font style='font-size:12px;'>
2017/3/6
Minimizing the Boolean circuit implementation of a given cryptographic function is an important issue. A number of papers [12,13,11,5] only consider cancellation-free straight-line programs for produc...
High-speed VLSI implementation of Digit-serial Gaussian normal basis Multiplication over GF(2m)
Cryptography Logical Effort Gaussian Normal Basis multiplication
font style='font-size:12px;'>
2016/12/8
In this paper, by employing the logical effort technique an efficient and high-speed VLSI implementation of the digit-serial Gaussian normal basis multiplier is presented. It is constructed by using A...
Lightweight Multiplication in GF(2^n) with Applications to MDS Matrices
finite fields multiplication XOR-count
font style='font-size:12px;'>
2016/2/23
In this paper we consider the fundamental question of optimizing
finite field multiplications with one fixed element. Surprisingly,
this question did not receive much attention previously. We invest...
Collecting relations for the Number Field Sieve in $GF(p^6)$
the Number Field Sieve public-key cryptography
font style='font-size:12px;'>
2016/2/23
In order to assess the security of cryptosystems based on the discrete logarithm problem in
non-prime finite fields, as are the torus-based or pairing-based ones, we investigate thoroughly
the case ...
ECC on Your Fingertips: A Single Instruction Approach for Lightweight ECC Design in GF (p)
Elliptic curve Single instruction URISC
font style='font-size:12px;'>
2016/1/27
Lightweight implementation of Elliptic Curve Cryptography
on FPGA has been a popular research topic due to the boom of ubiquitous
computing. In this paper we propose a novel single instruction
base...
$GF(2^n)$ Bit-Parallel Squarer Using Generalized Polynomial Basis For a New Class of Irreducible Pentanomials
implementation implementation
font style='font-size:12px;'>
2016/1/26
We present explicit formulae and complexities of bit-parallel GF(2n) squarers for a new class of irreducible pentanomials xn+xn−1+xk+x+1, where n is odd and 1
Finding Roots in GF(p^n) with the Successive Resultant Algorithm
number theory Successive Resultant Algorithm
font style='font-size:12px;'>
2016/1/8
The problem of solving polynomial equations over finite fields has many applications
in cryptography and coding theory. In this paper, we consider polynomial equations
over a “large” finite field wi...
A new public key system based on Polynomials over finite fields GF(2)
discrete logarithm problem public-key cryptography digital signatures
font style='font-size:12px;'>
2016/1/8
In this paper a new public key system based on polynomials over fields GF(2) is developed.
The security of the system is based on the difficulty of finding discrete logarithms over GF(2k
)
with suf...
A Chinese Remainder Theorem Approach to Bit-Parallel GF(2^n) Polynomial Basis Multipliers for Irreducible Trinomials
implementation Irreducible Trinomials
font style='font-size:12px;'>
2016/1/5
We show that the step “modulo the degree-n field generating irreducible polynomial” in the classical definition of the GF(2^n) multiplication operation can be avoided. This leads to an alternative rep...
Optimal software-implemented Itoh--Tsujii inversion for GF($2^m$)
finite fields inversion number theory
font style='font-size:12px;'>
2016/1/5
Field inversion in F2m dominates the cost of modern software implementations of certain elliptic
curve cryptographic operations, such as point encoding/hashing into elliptic curves. [7, 6, 2]
Itoh–T...