1
0
mirror of http://galexander.org/git/simplesshd.git synced 2024-11-15 11:38:56 +00:00
simplesshd/dropbear/libtomcrypt/src/misc/crypt/crypt_find_cipher_any.c

50 lines
1.4 KiB
C
Raw Normal View History

#define LTC_SOURCE
2014-12-10 21:56:49 +00:00
/* LibTomCrypt, modular cryptographic library -- Tom St Denis
*
* LibTomCrypt is a library that provides various cryptographic
* algorithms in a highly modular and flexible manner.
*
* The library is free for all purposes without any express
* guarantee it works.
*/
#include "tomcrypt.h"
/**
@file crypt_find_cipher_any.c
Find a cipher in the descriptor tables, Tom St Denis
*/
/**
2019-06-09 20:44:26 +00:00
Find a cipher flexibly. First by name then if not present by block and key size
2014-12-10 21:56:49 +00:00
@param name The name of the cipher desired
@param blocklen The minimum length of the block cipher desired (octets)
@param keylen The minimum length of the key size desired (octets)
@return >= 0 if found, -1 if not present
*/
int find_cipher_any(const char *name, int blocklen, int keylen)
{
int x;
2019-06-09 20:44:26 +00:00
if(name != NULL) {
x = find_cipher(name);
if (x != -1) return x;
}
2014-12-10 21:56:49 +00:00
LTC_MUTEX_LOCK(&ltc_cipher_mutex);
for (x = 0; x < TAB_SIZE; x++) {
if (cipher_descriptor[x].name == NULL) {
continue;
}
if (blocklen <= (int)cipher_descriptor[x].block_length && keylen <= (int)cipher_descriptor[x].max_key_length) {
LTC_MUTEX_UNLOCK(&ltc_cipher_mutex);
return x;
}
}
LTC_MUTEX_UNLOCK(&ltc_cipher_mutex);
return -1;
}
2019-06-09 20:44:26 +00:00
/* ref: $Format:%D$ */
/* git commit: $Format:%H$ */
/* commit time: $Format:%ai$ */