搜索结果: 1-15 共查到“军事学 subgroup”相关记录17条 . 查询时间(0.511 秒)
Faster Subgroup Checks for BLS12-381
elliptic curve cryptosystem public-key cryptography implementation
2019/7/15
Pairing-friendly elliptic curve constructions provide two elliptic curve groups which are both of prime order qq and usually each have a nontrivial cofactor hh. Due to the way these curves are typical...
On the Quantum Complexity of the Continuous Hidden Subgroup Problem
Quantum Algorithm Hidden Subgroup Period Finding
2019/6/19
The Hidden Subgroup Problem (HSP) aims at capturing all problems that are susceptible to be solvable in quantum polynomial time following the blueprints of Shor's celebrated algorithm. Successful solu...
Prime, Order Please! Revisiting Small Subgroup and Invalid Curve Attacks on Protocols using Diffie-Hellman
formal verification symbolic model tamarin prover
2019/5/21
Diffie-Hellman groups are a widely used component in cryptographic protocols in which a shared secret is needed. These protocols are typically proven to be secure under the assumption they are impleme...
Scalar multiplication in compressed coordinates in the trace-zero subgroup
elliptic curve cryptography trace-zero subgroup
2017/9/18
We consider trace-zero subgroups of elliptic curves over a degree three field extension. The elements of these groups can be represented in compressed coordinates, i.e. via the two coefficients of the...
Measuring small subgroup attacks against Diffie-Hellman
diffie-hellman small subgroup attack
2016/12/8
Several recent standards, including NIST SP 800- 56A and RFC 5114, advocate the use of “DSA” parameters for Diffie-Hellman key exchange. While it is possible to use such parameters securely, additiona...
Adversary-dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli
factoring assumption semi-smooth RSA subgroup modulus lossy trapdoor function
2016/6/6
Lossy trapdoor functions (LTDFs), proposed by Peikert and Waters (STOC'08), are known to have a number of applications in cryptography. They have been constructed based on various assumptions, which i...
Point compression for the trace zero subgroup over a small degree extension field
trace zero variety efficient representation point compression
2016/1/25
Using Semaev’s summation polynomials, we derive a new equation for the Fqrational
points of the trace zero variety of an elliptic curve defined over Fq. Using this
equation, we produce an optimal-si...
Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption
foundations obfuscation
2016/1/23
We revisit the question of constructing secure general-purpose indistinguishability obfuscation (iO), with a security reduction based on explicit computational assumptions over multilinear maps. Pre...
An optimal representation for the trace zero subgroup
public-key cryptography elliptic curve cryptosystem
2016/1/9
We give an optimal-size representation for the elements of the trace zero subgroup
of the Picard group of an elliptic or hyperelliptic curve of any genus, with respect to a field
extension of any pr...
Subgroup security in pairing-based cryptography
Pairing-based cryptography elliptic-curve cryptography pairing-friendly curves
2016/1/3
Pairings are typically implemented using ordinary pairingfriendly
elliptic curves. The two input groups of the pairing function are
groups of elliptic curve points, while the target group lies in th...
A representation of the $p$-sylow subgroup of $\perm(\F_p^n)$ and a cryptographic application
cryptographic protocols Diffie-Hellmann session key exchange
2011/7/25
This article concerns itself with the triangular permutation group, induced by triangular polynomial maps over $\F_p$, which is a $p$-sylow subgroup of $\perm(\F_p^n)$.
A representation of the $p$-sylow subgroup of $\perm(\F_p^n)$ and a cryptographic application
cryptographic protocols / Diffie-Hellmann session key exchange
2012/3/27
This article concerns itself with the triangular permutation group, induced by triangular polynomial maps over $\F_p$, which is a $p$-sylow subgroup of $\perm(\F_p^n)$. The aim of this article is twof...
Cryptanalysis of the RSA Subgroup Assumption from TCC 2005
rsa moduli hidden order subgroup cryptanalysis
2010/12/22
At TCC 2005, Groth underlined the usefulness of working in small RSA subgroups of hidden order. In assessing the security of the relevant hard problems, however, the best attack considered for a subgr...
Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
Pairing-based cryptography torus-based cryptography finite field arithmetic
2009/12/29
This paper describes an extremely efficient squaring operation
in the so-called ‘cyclotomic subgroup’ of F×
q6 , for q 1 mod 6. This
result arises from considering the Weil restriction of scalars...
Homomorphic public-key systems based on subgroup membership problems
Homomorphic public-key systems subgroup membership problems
2009/4/9
We describe the group structure underlying several popular homo-
morphic public-key systems and the problems they are based on. We
prove several well-known security results using only the group stru...