Questions tagged [domain-parameters]

Domain parameters are a set of parameters, usually large integers, that define the characteristics and bounds of a domain. They are for instance used for Diffie-Hellman calculations and Elliptic Curve calculations. The domain defines the key size that is used.

Filter by
Sorted by
Tagged with
3 votes
1 answer
111 views

Bilinear pairing for compact BLS signature

What family of bilinear pairing is recommendable for BLS signature when the overriding criteria is compactness of the signature, as desirable for something to be keyed-in from printout, or embedded in ...
fgrieu's user avatar
  • 137k
2 votes
1 answer
47 views

exponent bit-length for hard DL (128-bit security)

Following up on my previous post, I thought I might get a more concrete answer if I gave a more concrete question. I require 128-bit security so I choose a 3072-bit RSA modulus ($\ell_n=3072$). ...
gormatron3000's user avatar
2 votes
1 answer
82 views

Hardness of DL in group of Quadratic Residues (product of safe primes)

A protocol I am working with requires $\ell_n$-bit RSA modulus and $\ell_\Lambda$ such that computing $\ell_\Lambda$-bit discrete logs is hard in $QR_n$ (technically $n$ is $\ell_n+2$ bits in the ...
gormatron3000's user avatar
5 votes
2 answers
410 views

DDH hardness with shared public parameters

DDH is believed hard for subgroup of $ℤ^*_p$ with order $q=(p-1)/2$ when $p$ is a safe prime chosen randomly. What if $p$ isn't random: When parameters are shared, $p$ mightn't have been chosen ...
bs-'s user avatar
  • 83
0 votes
1 answer
44 views

Domain parameters in the Schnorr identification scheme

I have been recently studying the Schnorr identification scheme. The book Cryptography: Theory and Practice by Stinson and Paterson states the following about the domain parameters in the Schnorr ...
Jan's user avatar
  • 53
1 vote
2 answers
99 views

What are the typical instance parameters of non-commutative cryptographic schemes?

Recently, I grew a tremendous interest for public-key cryptography based on "groupoids", and collaborated with someone on this topic. What I notice afterwards, is that there had been a huge ...
DannyNiu's user avatar
  • 8,648
4 votes
1 answer
1k views

Static Diffie-Hellman in TLS

Static Diffie-Hellman (cipher suites with DH in their name but neither DHE or DH_anon - ...
blabla_trace's user avatar
5 votes
3 answers
257 views

How to determine required number of rounds for RC6 cipher given custom W and B parameters?

The RC6 symmetric block cipher is parameterized with three parameters : W : The number of bits in a machine word (8 , 16 , 32 , 64) B : The number of bytes specifying key length (0 to 255) R : The ...
cookiecipher's user avatar
17 votes
3 answers
5k views

What does the special form of the base point of secp256k1 allow?

The popular ECC parameters secp256k1 are documented in SEC2 as using curve $y^2\equiv x^3+a\cdot x+b\pmod p$ with $a=0$, $b=7$, $p=2^{256}-2^{32}-\mathtt{3d1_h}$, base point $G$ with the apparently ...
fgrieu's user avatar
  • 137k
2 votes
1 answer
501 views

In a safe finite field elliptic curve, why is p not n?

From what I understand, in order for a curve to be safe, it would appear that $n$ being the order of the cyclic subgroup of the curve, is a prime. Also, it is the theoretical upper-bound on the number ...
gtr32x's user avatar
  • 159
3 votes
1 answer
293 views

Why does FIPS 186-4 seem to have an excessively complex q generation?

So in DSA you have two primes - p and q. q is N bits long (let's assume 160 bits) and p is L bits long (let's assume 1024 bits). Here's what FIPS 186-4 says about generating the q parameter for DSA: ...
neubert's user avatar
  • 2,875