mirror of
git://git.gnupg.org/gnupg.git
synced 2025-07-03 22:56:33 +02:00
common: Extend the openpgp_curve_to_oid function.
* common/openpgp-oid.c (openpgp_curve_to_oid): Add optional arg R_NBITS.
Change all callers.
--
In particular for ed25519 and cv25519 it is quite useful to have an
ability to get the required algorithm.
(cherry picked from commit 24095101a5
)
This commit is contained in:
parent
f3c98b8cb5
commit
5b8593135f
8 changed files with 24 additions and 14 deletions
|
@ -337,13 +337,17 @@ openpgp_oid_is_cv25519 (gcry_mpi_t a)
|
|||
|
||||
/* Map the Libgcrypt ECC curve NAME to an OID. If R_NBITS is not NULL
|
||||
store the bit size of the curve there. Returns NULL for unknown
|
||||
curve names. */
|
||||
curve names. If R_ALGO is not NULL and a specific ECC algorithm is
|
||||
required for this curve its OpenPGP algorithm number is stored
|
||||
there; otherwise 0 is stored which indicates that ECDSA or ECDH can
|
||||
be used. */
|
||||
const char *
|
||||
openpgp_curve_to_oid (const char *name, unsigned int *r_nbits)
|
||||
openpgp_curve_to_oid (const char *name, unsigned int *r_nbits, int *r_algo)
|
||||
{
|
||||
int i;
|
||||
unsigned int nbits = 0;
|
||||
const char *oidstr = NULL;
|
||||
int algo = 0;
|
||||
|
||||
if (name)
|
||||
{
|
||||
|
@ -353,6 +357,7 @@ openpgp_curve_to_oid (const char *name, unsigned int *r_nbits)
|
|||
{
|
||||
oidstr = oidtable[i].oidstr;
|
||||
nbits = oidtable[i].nbits;
|
||||
algo = oidtable[i].pubkey_algo;
|
||||
break;
|
||||
}
|
||||
if (!oidtable[i].name)
|
||||
|
@ -364,6 +369,7 @@ openpgp_curve_to_oid (const char *name, unsigned int *r_nbits)
|
|||
{
|
||||
oidstr = oidtable[i].oidstr;
|
||||
nbits = oidtable[i].nbits;
|
||||
algo = oidtable[i].pubkey_algo;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
@ -371,6 +377,8 @@ openpgp_curve_to_oid (const char *name, unsigned int *r_nbits)
|
|||
|
||||
if (r_nbits)
|
||||
*r_nbits = nbits;
|
||||
if (r_algo)
|
||||
*r_algo = algo;
|
||||
return oidstr;
|
||||
}
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue