搜索结果: 1-15 共查到“军事学 FIXED”相关记录21条 . 查询时间(0.033 秒)
Breaking the Bluetooth Pairing – The Fixed Coordinate Invalid Curve Attack
Bluetooth elliptic curve cryptosystem Diffie-Hellman
2019/9/19
Bluetooth is a widely deployed standard for wireless communications between mobile devices. It uses authenticated Elliptic Curve Diffie-Hellman for its key exchange. In this paper we show that the aut...
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 ...
The Distinction Between Fixed and Random Generators in Group-Based Assumptions
Diffie-Hellman preprocessing point obfuscation
2019/3/1
There is surprisingly little consensus on the precise role of the generator g in group-based assumptions such as DDH. Some works consider g to be a fixed part of the group description, while others ta...
Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers
random permutation mode secure computation
2019/1/26
Many implementations of secure computation use fixed-key AES (modeled as a random permutation); this results in substantial performance benefits due to existing hardware support for~AES and the abilit...
Lightweight MDS Serial-type Matrices with Minimal Fixed XOR Count
MDS matrix Serial matrix lightweight cryptography
2017/11/13
Many block ciphers and hash functions require the diffusion property of Maximum Distance Separable (MDS) matrices. Serial matrices with the MDS property obtain a trade-off between area requirement and...
An Algorithm for Counting the Number of $2^n$-Periodic Binary Sequences with Fixed $k$-Error Linear Complexity
Sequence Linear Complexity k-Error Linear Complexity
2016/12/7
The linear complexity and kk-error linear complexity of sequences are important measures of the strength of key-streams generated by stream ciphers. The counting function of a sequence complexity meas...
The purpose of this paper is to investigate fixed point arithmetic
in ring-based Somewhat Homomorphic Encryption (SHE) schemes.
We provide three main contributions: Firstly, we investigate the repre...
Hybrid Model of Fixed and Floating Point Numbers in Secure Multiparty Computations
cryptographic protocols secret sharing multi-party computations
2016/1/25
This paper develops a new hybrid model of floating point numbers suitable for operations
in secure multi-party computations. The basic idea is to consider the significand of the floating
point numbe...
On the discrete logarithm problem in finite fields of fixed characteristic
discrete logarithm problem finite fields quasi-polynomial time algorithm
2015/12/29
For q a prime power, the discrete logarithm problem (DLP) in F×q consists in finding, for any g∈F×q and h∈⟨g⟩, an integer x such that gx=h. For each prime p we exhibit infinitely many ex...
One of the criteria for substitutions used in block ciphers is the absence of fixed points. In this paper we show that this criterion must be extended taking into consideration a mixing key function. ...
We advocate schemes based on fixed-key AES as the best route to highly efficient circuit-garbling. We provide such schemes making only one AES call per garbled-gate evaluation. On the theoretical side...
We present an efficient key wrapping scheme that uses a single wide permutation and does not rely on block ciphers. The scheme is capable of wrapping keys up to 1400 bits long and processing arbitrari...
An Attack Against Fixed Value Discrete Logarithm Representations
cryptographic protocols / attribute-based credentials revocation cryptanalysi discrete logarithm representation
2013/4/18
Attribute-based credentials (ABCs) are an important building block of privacy-enhancing identity management. Since non-identifying attributes can easily be abused as the anonymity they provide hides t...
Fixed Argument Pairings
Pairings Miller’s algorithm Tate pairing ate pairing precomputation
2010/7/14
A common scenario in many pairing-based cryptographic protocols is that one argument in the pairing is fixed as a long term secret key or a constant parameter in the system. In these situations,...
Barreto-Naehrig Curve With Fixed Coefficient——Efficiently Constructing Pairing-Friendly Curves
Barreto-Naehrig Curve Fixed Coefficient Pairing-Friendly Curves
2010/3/16
This paper describes a method for constructing Barreto-
Naehrig (BN) curves and twists of BN curves that are pairing-friendly
and have the embedding degree 12 by using just primality tests without
...