A bivariate polynomial-based cryptographic hard problem and its applications (Q6109708): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10623-023-01229-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4367368509 / rank | |||
Normal rank | |||
Revision as of 11:04, 30 July 2024
scientific article; zbMATH DE number 7720067
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bivariate polynomial-based cryptographic hard problem and its applications |
scientific article; zbMATH DE number 7720067 |
Statements
A bivariate polynomial-based cryptographic hard problem and its applications (English)
0 references
28 July 2023
0 references
cryptographic hard problem
0 references
public-key cryptography
0 references
RSA cryptosystem
0 references
lattices
0 references
commitment schemes
0 references
