Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms (Q2167716)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7575939
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms |
scientific article; zbMATH DE number 7575939 |
Statements
Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms (English)
0 references
25 August 2022
0 references
RSA key generation
0 references
random oracle
0 references
non-interactive proof
0 references
0 references
0 references
0.8504156470298767
0 references
0.7724090814590454
0 references
0.7664939165115356
0 references
