搜索结果: 1-15 共查到“军事学 Special”相关记录19条 . 查询时间(0.125 秒)
N-term Karatsuba Algorithm and its Application to Multiplier designs for Special Trinomials
N-term Karatsuba Algorithm Specific trinomials Bit-parallel Multiplier
2018/6/19
We show that such a type of trinomial combined with the nn-term KA can fully exploit the spatial correlation of entries in related Mastrovito product matrices and lead to a low complexity architecture...
Cycle Slicer: An Algorithm for Building Permutations on Special Domains
format-preserving encryption small-domain block ciphers Markov chains
2017/9/14
We introduce an algorithm called Cycle Slicer that gives new solutions to two important problems in format-preserving encryption: domain targeting and domain completion. In domain targeting, where we ...
CM55: special prime-field elliptic curves almost optimizing den Boer's reduction between Diffie-Hellman and discrete logs
public-key cryptography elliptic curve
2016/1/6
Using the Pohlig–Hellman algorithm, den Boer reduced the discrete logarithm problem
to the Diffie–Hellman problem in groups of an order whose prime factors were each
one plus a smooth number. This r...
A Simple Method for Obtaining Relations Among Factor Basis Elements for Special Hyperelliptic Curves
hyperelliptic curves index calculus algorithm Nagao’s decomposition
2016/1/3
Nagao had proposed a decomposition method for divisors of hyperelliptic curves defined over a field \rFqn with n≥2. Joux and Vitse had later proposed a variant which provided relations among the facto...
Scalar Blinding on Elliptic Curves based on Primes with Special Structure
public-key cryptography elliptic curve cryptosystem
2015/12/24
This paper shows how scalar blinding can provide protection against side channel
attacks when performing elliptic curve operations with modest cost, even if the
characteristic of the field has a spa...
The Special Number Field Sieve in $\F _{p^{n}}$, Application to Pairing-Friendly Constructions
Discrete logarithms SNFS
2014/3/10
In this paper, we study the discrete logarithm problem in finite fields related to pairing-based curves. We start with a precise analysis of the state-of-the-art algorithms for computing discrete loga...
We study collusion-resistant traitor tracing in the simple decoder approach, i.e. assignment of scores for each user separately. We introduce a new score function for non-binary bias-based traitor tra...
AES-like ciphers: are special S-boxes better then random ones? (Virtual isomorphisms again)
AES block ciphers cryptanalysis linear cryptanalysis
2013/4/18
In [eprint.iacr.org/2012/663] method of virtual isomorphisms of ciphers was applied for differential/linear cryptanalysis of AES. It was shown that AES seems to be weak against those attacks. That res...
Cryptanalysis of the Full AES Using GPU-Like Special-Purpose Hardware
AES Cryptanalysis Cryptanalytic Hardware
2012/6/14
The block cipher Rijndael has undergone more than ten years of extensive cryptanalysis since its submission as a candidate for the Advanced Encryption Standard (AES) in April 1998. To date, most of th...
Cryptanalysis of the Full AES Using GPU-Like Special-Purpose Hardware
secret-key cryptography / AES Cryptanalysis Cryptanalytic Hardware
2012/3/20
The block cipher Rijndael has undergone more than ten years of extensive cryptanalysis since its submission as a candidate for the Advanced Encryption Standard (AES) in April 1998. To date, most of th...
Cryptanalysis of the Full AES Using GPU-Like Special-Purpose Hardware
AES Cryptanalysis Cryptanalytic Hardware
2012/8/28
The block cipher Rijndael has undergone more than ten years of extensive cryptanalysis since its submission as a candidate for the Advanced Encryption Standard (AES) in April 1998. To date, most of th...
Faster Pairings on Special Weierstrass Curves
Tate pairing Miller’s algorithm elliptic curves
2009/6/15
This paper presents efficient formulas for computing cryptographic
pairings on the curve y2 = cx3 + 1 over fields of large characteristic. We
provide examples of pairing-friendly elliptic curves of ...
PET SNAKE: A Special Purpose Architecture to Implement an Algebraic Attack in Hardware
block cipher algebraic attack cryptanalytic hardware
2009/6/15
In [19] Raddum and Semaev propose a technique to solve systems of polynomial equations
over F2 as occurring in algebraic attacks on block ciphers. This approach is known as MRHS, and
we present a sp...
Special Polynomial Families for Generating More Suitable Elliptic Curves for Pairing-Based Cryptosystems
pairing-friendly elliptic curves special polynomial families cyclotomic polynomials
2009/3/9
Constructing non-supersingular elliptic curves for pairing-based cryptosystems have
attracted much attention in recent years. The best previous technique builds curves
with ρ = lg(q)/lg(r) ≈ 1 (k = ...
A New Concept of Hash Functions SNMAC Using a Special Block Cipher and NMAC/HMAC Constructions
Hash function NMAC HMAC
2008/12/25
In this paper, we present new security proofs of well-known hash constructions NMAC/HMAC proposed by Bellare et al. in 1996. We show that block ciphers should be used in hash functions in another way ...