You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Some details of the cryptographic defaults used in the main library used to encrypt the election should be available for transparency and clarity.
The following parameters should have a link to where there are defined for easy checks:
The parameter p used to compute the modular arithmetic operations must be a prime number whose discrete logarithm is not solvable in an assumable time in . This means that p -1 must have a large prime factor which makes the discrete logarithm problem difficult.
The size of this parameter p must be of 4096 bits
The parameter q must be a prime number which divides -1` and its length is 256 bits.
The parameter r must be computed as r=(p -1)/q
The parameter g must be a generator in . This means that, in , g can be expressed as a combination (under the group operation) of finitely many elements of the subset and their inverses.
The messages sent from Decidim server and to the BulletinBoard are signed using 4096-bit RSA keys and SHA-256 hashes.
Finally, since the system uses external libraries, links to the bug-reporting pages of those libraries should be available through the documentation.
The text was updated successfully, but these errors were encountered:
Some details of the cryptographic defaults used in the main library used to encrypt the election should be available for transparency and clarity.
The following parameters should have a link to where there are defined for easy checks:
The parameter
p
used to compute the modular arithmetic operations must be a prime number whose discrete logarithm is not solvable in an assumable time in . This means thatp -1
must have a large prime factor which makes the discrete logarithm problem difficult.The size of this parameter
p
must be of 4096 bitsThe parameter
q
must be a prime number which divides -1` and its length is 256 bits.The parameter
r
must be computed asr=(p -1)/q
The parameter
g
must be a generator in . This means that, in ,g
can be expressed as a combination (under the group operation) of finitely many elements of the subset and their inverses.The messages sent from Decidim server and to the BulletinBoard are signed using 4096-bit RSA keys and SHA-256 hashes.
Finally, since the system uses external libraries, links to the bug-reporting pages of those libraries should be available through the documentation.
The text was updated successfully, but these errors were encountered: