搜索结果: 1-15 共查到“军事学 binary”相关记录79条 . 查询时间(0.109 秒)
Batch Binary Weierstrass
public-key cryptography elliptic curve cryptosystem implementation
2019/7/18
Bitslicing is a programming technique that offers several attractive features, such as timing attack resistance, high amortized performance in batch computation, and architecture independence. On the ...
Linear Complexity of A Family of Binary pq2 -periodic Sequences From Euler Quotients
Cryptography linear complexity binary sequences
2019/6/21
We first introduce a family of binary pq2pq2 -periodic sequences based on the Euler quotients modulo pqpq, where pp and qq are two distinct odd primes and pp divides q−1q−1. The minimal po...
A SAT-based approach for index calculus on binary elliptic curves
discrete logarithm index calculus elliptic curves
2019/3/22
Logical cryptanalysis, first introduced by Massacci in 2000, is a viable alternative to common algebraic cryptanalysis techniques over boolean fields. With XOR operations being at the core of many cry...
Solving binary MQ with Grover's algorithm
Grover's algorithm multivariate quadratics quantum resource estimates
2019/2/25
The problem of solving a system of quadratic equations in multiple variables---known as multivariate-quadratic or MQ problem---is the underlying hard problem of various cryptosystems. For efficiency r...
On the Hardness of Learning With Errors with Binary Secrets
complexity theory lattice based cryptography foundations
2018/11/5
We give a simple proof that the decisional Learning With Errors (LWE) problem with binary secrets (and an arbitrary polynomial number of samples) is at least as hard as the standard LWE problem (with ...
Secret Sharing with Binary Shares
Secret Sharing Scheme Stochastic Code Randomness Extractors
2018/8/20
Secret sharing is a fundamental cryptographic primitive. One of the main goals of secret sharing is to share a long secret using small shares. In this paper we consider a family of statistical secret ...
LP Solutions of Vectorial Integer Subset Sums - Cryptanalysis of Galbraith's Binary Matrix LWE
Binary matrix LWE Linear Programming Cryptanalysis
2018/8/16
We consider Galbraith's space efficient LWE variant, where the (m×n)(m×n)-matrix AA is binary. In this binary case, solving a vectorial subset sum problem over the integers allows for decryption. We s...
A new class of irreducible pentanomials for polynomial based multipliers in binary fields
irreducible pentanomials polynomial multiplication modular reduction
2018/6/5
We give the total cost of the multiplier and found that the bit-parallel multiplier defined by this new class of polynomials has improved XOR and AND complexity. Our multiplier has comparable time del...
Efficient Parallel Binary Operations on Homomorphic Encrypted Real Numbers
implementation homomorphic encryption
2018/3/5
A number of homomorphic encryption application areas, such as privacy-preserving machine learning analysis in the cloud, could be better enabled if there existed a general solution for combining suffi...
Polynomial multiplication over binary finite fields: new upper bounds
Polynomial multiplication Karatsuba Two-level Seven-way Recursion algorithm
2018/1/29
When implementing a cryptographic algorithm, efficient operations have high relevance both in hardware and software. Since a number of operations can be performed via polynomial multiplication, the ar...
A Simple Reduction from State Machine Replication to Binary Agreement in Partially Synchronous or Asynchronous Networks
SMR BA
2018/1/17
The recent advent of blockchains has spurred a huge interest in the research and development of numerous cryptocurrencies as well as understanding the fundamental concepts that underly this technology...
FPGA-based Niederreiter Cryptosystem using Binary Goppa Codes
post-quantum cryptography code-based cryptography Niederreiter cryptosystem
2017/12/11
This paper presents an FPGA implementation of the Niederreiter cryptosystem using binary Goppa codes, including modules for encryption, decryption, and key generation. We improve over previous impleme...
On Fast Multiplication in Binary Finite Fields and Optimal Primitive Polynomials over GF(2)
implementation multiplication modular reduction
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...
Fast Scalar Multiplication for Elliptic Curves over Binary Fields by Efficiently Computable Formulas
binary elliptic curves point multiplication lambda coordinates
2017/9/7
This paper considers efficient scalar multiplication of elliptic curves over binary fields with a twofold purpose. Firstly, we derive the most efficient 3P3P formula in λλ-projective coordinates and 5...
Binary Hash Tree based Certificate Access Management
Binary tree certificate access management
2017/8/10
We present a certificate access management system to support the USDOT's proposed rule on Vehicle-to-Vehicle (V2V) communications, Federal Motor Vehicle Safety Standard (FMVSS) No.~150. Our proposal, ...