1 /* crypto/srp/srp_vfy.c */
3 * Written by Christophe Renou (christophe.renou@edelweb.fr) with the
4 * precious help of Peter Sylvester (peter.sylvester@edelweb.fr) for the
5 * EdelKey project and contributed to the OpenSSL project 2004.
7 /* ====================================================================
8 * Copyright (c) 2004 The OpenSSL Project. All rights reserved.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in
19 * the documentation and/or other materials provided with the
22 * 3. All advertising materials mentioning features or use of this
23 * software must display the following acknowledgment:
24 * "This product includes software developed by the OpenSSL Project
25 * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
27 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
28 * endorse or promote products derived from this software without
29 * prior written permission. For written permission, please contact
30 * licensing@OpenSSL.org.
32 * 5. Products derived from this software may not be called "OpenSSL"
33 * nor may "OpenSSL" appear in their names without prior written
34 * permission of the OpenSSL Project.
36 * 6. Redistributions of any form whatsoever must retain the following
38 * "This product includes software developed by the OpenSSL Project
39 * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
41 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
42 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
44 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
45 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
46 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
47 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
48 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
49 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
50 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
51 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
52 * OF THE POSSIBILITY OF SUCH DAMAGE.
53 * ====================================================================
55 * This product includes cryptographic software written by Eric Young
56 * (eay@cryptsoft.com). This product includes software written by Tim
57 * Hudson (tjh@cryptsoft.com).
60 #ifndef OPENSSL_NO_SRP
61 # include "cryptlib.h"
63 # include <openssl/srp.h>
64 # include <openssl/evp.h>
65 # include <openssl/buffer.h>
66 # include <openssl/rand.h>
67 # include <openssl/txt_db.h>
69 # define SRP_RANDOM_SALT_LEN 20
72 static char b64table
[] =
73 "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz./";
76 * the following two conversion routines have been inspired by code from
81 * Convert a base64 string into raw byte array representation.
83 static int t_fromb64(unsigned char *a
, const char *src
)
89 while (*src
&& (*src
== ' ' || *src
== '\t' || *src
== '\n'))
94 loc
= strchr(b64table
, src
[i
]);
98 a
[i
] = loc
- b64table
;
101 /* if nothing valid to process we have a zero length response */
111 a
[j
] |= (a
[i
] & 3) << 6;
113 a
[j
] = (unsigned char)((a
[i
] & 0x3c) >> 2);
116 a
[j
] |= (a
[i
] & 0xf) << 4;
118 a
[j
] = (unsigned char)((a
[i
] & 0x30) >> 4);
127 while (a
[j
] == 0 && j
<= size
)
136 * Convert a raw byte string into a null-terminated base64 ASCII string.
138 static char *t_tob64(char *dst
, const unsigned char *src
, int size
)
140 int c
, pos
= size
% 3;
141 unsigned char b0
= 0, b1
= 0, b2
= 0, notleading
= 0;
155 c
= (b0
& 0xfc) >> 2;
156 if (notleading
|| c
!= 0) {
157 *dst
++ = b64table
[c
];
160 c
= ((b0
& 3) << 4) | ((b1
& 0xf0) >> 4);
161 if (notleading
|| c
!= 0) {
162 *dst
++ = b64table
[c
];
165 c
= ((b1
& 0xf) << 2) | ((b2
& 0xc0) >> 6);
166 if (notleading
|| c
!= 0) {
167 *dst
++ = b64table
[c
];
171 if (notleading
|| c
!= 0) {
172 *dst
++ = b64table
[c
];
188 void SRP_user_pwd_free(SRP_user_pwd
*user_pwd
)
190 if (user_pwd
== NULL
)
192 BN_free(user_pwd
->s
);
193 BN_clear_free(user_pwd
->v
);
194 OPENSSL_free(user_pwd
->id
);
195 OPENSSL_free(user_pwd
->info
);
196 OPENSSL_free(user_pwd
);
199 static SRP_user_pwd
*SRP_user_pwd_new()
201 SRP_user_pwd
*ret
= OPENSSL_malloc(sizeof(SRP_user_pwd
));
213 static void SRP_user_pwd_set_gN(SRP_user_pwd
*vinfo
, const BIGNUM
*g
,
220 static int SRP_user_pwd_set_ids(SRP_user_pwd
*vinfo
, const char *id
,
223 if (id
!= NULL
&& NULL
== (vinfo
->id
= BUF_strdup(id
)))
225 return (info
== NULL
|| NULL
!= (vinfo
->info
= BUF_strdup(info
)));
228 static int SRP_user_pwd_set_sv(SRP_user_pwd
*vinfo
, const char *s
,
231 unsigned char tmp
[MAX_LEN
];
234 if (strlen(s
) > MAX_LEN
|| strlen(v
) > MAX_LEN
)
236 len
= t_fromb64(tmp
, v
);
237 if (NULL
== (vinfo
->v
= BN_bin2bn(tmp
, len
, NULL
)))
239 len
= t_fromb64(tmp
, s
);
240 return ((vinfo
->s
= BN_bin2bn(tmp
, len
, NULL
)) != NULL
);
243 static int SRP_user_pwd_set_sv_BN(SRP_user_pwd
*vinfo
, BIGNUM
*s
, BIGNUM
*v
)
247 return (vinfo
->s
!= NULL
&& vinfo
->v
!= NULL
);
250 static SRP_user_pwd
*srp_user_pwd_dup(SRP_user_pwd
*src
)
256 if ((ret
= SRP_user_pwd_new()) == NULL
)
259 SRP_user_pwd_set_gN(ret
, src
->g
, src
->N
);
260 if (!SRP_user_pwd_set_ids(ret
, src
->id
, src
->info
)
261 || !SRP_user_pwd_set_sv_BN(ret
, BN_dup(src
->s
), BN_dup(src
->v
))) {
262 SRP_user_pwd_free(ret
);
268 SRP_VBASE
*SRP_VBASE_new(char *seed_key
)
270 SRP_VBASE
*vb
= (SRP_VBASE
*)OPENSSL_malloc(sizeof(SRP_VBASE
));
274 if (!(vb
->users_pwd
= sk_SRP_user_pwd_new_null()) ||
275 !(vb
->gN_cache
= sk_SRP_gN_cache_new_null())) {
279 vb
->default_g
= NULL
;
280 vb
->default_N
= NULL
;
282 if ((seed_key
!= NULL
) && (vb
->seed_key
= BUF_strdup(seed_key
)) == NULL
) {
283 sk_SRP_user_pwd_free(vb
->users_pwd
);
284 sk_SRP_gN_cache_free(vb
->gN_cache
);
291 int SRP_VBASE_free(SRP_VBASE
*vb
)
293 sk_SRP_user_pwd_pop_free(vb
->users_pwd
, SRP_user_pwd_free
);
294 sk_SRP_gN_cache_free(vb
->gN_cache
);
295 OPENSSL_free(vb
->seed_key
);
300 static SRP_gN_cache
*SRP_gN_new_init(const char *ch
)
302 unsigned char tmp
[MAX_LEN
];
305 SRP_gN_cache
*newgN
=
306 (SRP_gN_cache
*)OPENSSL_malloc(sizeof(SRP_gN_cache
));
310 if ((newgN
->b64_bn
= BUF_strdup(ch
)) == NULL
)
313 len
= t_fromb64(tmp
, ch
);
314 if ((newgN
->bn
= BN_bin2bn(tmp
, len
, NULL
)))
317 OPENSSL_free(newgN
->b64_bn
);
323 static void SRP_gN_free(SRP_gN_cache
*gN_cache
)
325 if (gN_cache
== NULL
)
327 OPENSSL_free(gN_cache
->b64_bn
);
328 BN_free(gN_cache
->bn
);
329 OPENSSL_free(gN_cache
);
332 static SRP_gN
*SRP_get_gN_by_id(const char *id
, STACK_OF(SRP_gN
) *gN_tab
)
338 for (i
= 0; i
< sk_SRP_gN_num(gN_tab
); i
++) {
339 gN
= sk_SRP_gN_value(gN_tab
, i
);
340 if (gN
&& (id
== NULL
|| strcmp(gN
->id
, id
) == 0))
344 return SRP_get_default_gN(id
);
347 static BIGNUM
*SRP_gN_place_bn(STACK_OF(SRP_gN_cache
) *gN_cache
, char *ch
)
350 if (gN_cache
== NULL
)
353 /* search if we have already one... */
354 for (i
= 0; i
< sk_SRP_gN_cache_num(gN_cache
); i
++) {
355 SRP_gN_cache
*cache
= sk_SRP_gN_cache_value(gN_cache
, i
);
356 if (strcmp(cache
->b64_bn
, ch
) == 0)
359 { /* it is the first time that we find it */
360 SRP_gN_cache
*newgN
= SRP_gN_new_init(ch
);
362 if (sk_SRP_gN_cache_insert(gN_cache
, newgN
, 0) > 0)
371 * this function parses verifier file. Format is:
372 * string(index):base64(N):base64(g):0
373 * string(username):base64(v):base64(salt):int(index)
376 int SRP_VBASE_init(SRP_VBASE
*vb
, char *verifier_file
)
379 STACK_OF(SRP_gN
) *SRP_gN_tab
= sk_SRP_gN_new_null();
380 char *last_index
= NULL
;
385 SRP_user_pwd
*user_pwd
= NULL
;
387 TXT_DB
*tmpdb
= NULL
;
388 BIO
*in
= BIO_new(BIO_s_file());
390 error_code
= SRP_ERR_OPEN_FILE
;
392 if (in
== NULL
|| BIO_read_filename(in
, verifier_file
) <= 0)
395 error_code
= SRP_ERR_VBASE_INCOMPLETE_FILE
;
397 if ((tmpdb
= TXT_DB_read(in
, DB_NUMBER
)) == NULL
)
400 error_code
= SRP_ERR_MEMORY
;
403 last_index
= SRP_get_default_gN(NULL
)->id
;
405 for (i
= 0; i
< sk_OPENSSL_PSTRING_num(tmpdb
->data
); i
++) {
406 pp
= sk_OPENSSL_PSTRING_value(tmpdb
->data
, i
);
407 if (pp
[DB_srptype
][0] == DB_SRP_INDEX
) {
409 * we add this couple in the internal Stack
412 if ((gN
= (SRP_gN
*) OPENSSL_malloc(sizeof(SRP_gN
))) == NULL
)
415 if (!(gN
->id
= BUF_strdup(pp
[DB_srpid
]))
417 SRP_gN_place_bn(vb
->gN_cache
, pp
[DB_srpverifier
]))
418 || !(gN
->g
= SRP_gN_place_bn(vb
->gN_cache
, pp
[DB_srpsalt
]))
419 || sk_SRP_gN_insert(SRP_gN_tab
, gN
, 0) == 0)
424 if (vb
->seed_key
!= NULL
) {
425 last_index
= pp
[DB_srpid
];
427 } else if (pp
[DB_srptype
][0] == DB_SRP_VALID
) {
428 /* it is a user .... */
430 if ((lgN
= SRP_get_gN_by_id(pp
[DB_srpgN
], SRP_gN_tab
)) != NULL
) {
431 error_code
= SRP_ERR_MEMORY
;
432 if ((user_pwd
= SRP_user_pwd_new()) == NULL
)
435 SRP_user_pwd_set_gN(user_pwd
, lgN
->g
, lgN
->N
);
436 if (!SRP_user_pwd_set_ids
437 (user_pwd
, pp
[DB_srpid
], pp
[DB_srpinfo
]))
440 error_code
= SRP_ERR_VBASE_BN_LIB
;
441 if (!SRP_user_pwd_set_sv
442 (user_pwd
, pp
[DB_srpsalt
], pp
[DB_srpverifier
]))
445 if (sk_SRP_user_pwd_insert(vb
->users_pwd
, user_pwd
, 0) == 0)
447 user_pwd
= NULL
; /* abandon responsability */
452 if (last_index
!= NULL
) {
453 /* this means that we want to simulate a default user */
455 if (((gN
= SRP_get_gN_by_id(last_index
, SRP_gN_tab
)) == NULL
)) {
456 error_code
= SRP_ERR_VBASE_BN_LIB
;
459 vb
->default_g
= gN
->g
;
460 vb
->default_N
= gN
->N
;
463 error_code
= SRP_NO_ERROR
;
467 * there may be still some leaks to fix, if this fails, the application
468 * terminates most likely
472 OPENSSL_free(gN
->id
);
476 SRP_user_pwd_free(user_pwd
);
483 sk_SRP_gN_free(SRP_gN_tab
);
489 static SRP_user_pwd
*find_user(SRP_VBASE
*vb
, char *username
)
497 for (i
= 0; i
< sk_SRP_user_pwd_num(vb
->users_pwd
); i
++) {
498 user
= sk_SRP_user_pwd_value(vb
->users_pwd
, i
);
499 if (strcmp(user
->id
, username
) == 0)
507 * This method ignores the configured seed and fails for an unknown user.
508 * Ownership of the returned pointer is not released to the caller.
509 * In other words, caller must not free the result.
511 SRP_user_pwd
*SRP_VBASE_get_by_user(SRP_VBASE
*vb
, char *username
)
513 return find_user(vb
, username
);
517 * Ownership of the returned pointer is released to the caller.
518 * In other words, caller must free the result once done.
520 SRP_user_pwd
*SRP_VBASE_get1_by_user(SRP_VBASE
*vb
, char *username
)
523 unsigned char digv
[SHA_DIGEST_LENGTH
];
524 unsigned char digs
[SHA_DIGEST_LENGTH
];
530 if ((user
= find_user(vb
, username
)) != NULL
)
531 return srp_user_pwd_dup(user
);
533 if ((vb
->seed_key
== NULL
) ||
534 (vb
->default_g
== NULL
) || (vb
->default_N
== NULL
))
537 /* if the user is unknown we set parameters as well if we have a seed_key */
539 if ((user
= SRP_user_pwd_new()) == NULL
)
542 SRP_user_pwd_set_gN(user
, vb
->default_g
, vb
->default_N
);
544 if (!SRP_user_pwd_set_ids(user
, username
, NULL
))
547 if (RAND_pseudo_bytes(digv
, SHA_DIGEST_LENGTH
) < 0)
549 EVP_MD_CTX_init(&ctxt
);
550 EVP_DigestInit_ex(&ctxt
, EVP_sha1(), NULL
);
551 EVP_DigestUpdate(&ctxt
, vb
->seed_key
, strlen(vb
->seed_key
));
552 EVP_DigestUpdate(&ctxt
, username
, strlen(username
));
553 EVP_DigestFinal_ex(&ctxt
, digs
, NULL
);
554 EVP_MD_CTX_cleanup(&ctxt
);
555 if (SRP_user_pwd_set_sv_BN
556 (user
, BN_bin2bn(digs
, SHA_DIGEST_LENGTH
, NULL
),
557 BN_bin2bn(digv
, SHA_DIGEST_LENGTH
, NULL
)))
560 err
:SRP_user_pwd_free(user
);
565 * create a verifier (*salt,*verifier,g and N are in base64)
567 char *SRP_create_verifier(const char *user
, const char *pass
, char **salt
,
568 char **verifier
, const char *N
, const char *g
)
571 char *result
= NULL
, *vf
= NULL
;
572 BIGNUM
*N_bn
= NULL
, *g_bn
= NULL
, *s
= NULL
, *v
= NULL
;
573 unsigned char tmp
[MAX_LEN
];
574 unsigned char tmp2
[MAX_LEN
];
575 char *defgNid
= NULL
;
578 if ((user
== NULL
) ||
579 (pass
== NULL
) || (salt
== NULL
) || (verifier
== NULL
))
583 if (!(len
= t_fromb64(tmp
, N
)))
585 N_bn
= BN_bin2bn(tmp
, len
, NULL
);
586 if (!(len
= t_fromb64(tmp
, g
)))
588 g_bn
= BN_bin2bn(tmp
, len
, NULL
);
591 SRP_gN
*gN
= SRP_get_gN_by_id(g
, NULL
);
600 if (RAND_pseudo_bytes(tmp2
, SRP_RANDOM_SALT_LEN
) < 0)
603 s
= BN_bin2bn(tmp2
, SRP_RANDOM_SALT_LEN
, NULL
);
605 if (!(len
= t_fromb64(tmp2
, *salt
)))
607 s
= BN_bin2bn(tmp2
, len
, NULL
);
610 if (!SRP_create_verifier_BN(user
, pass
, &s
, &v
, N_bn
, g_bn
))
614 vfsize
= BN_num_bytes(v
) * 2;
615 if (((vf
= OPENSSL_malloc(vfsize
)) == NULL
))
617 t_tob64(vf
, tmp
, BN_num_bytes(v
));
622 if ((tmp_salt
= OPENSSL_malloc(SRP_RANDOM_SALT_LEN
* 2)) == NULL
) {
625 t_tob64(tmp_salt
, tmp2
, SRP_RANDOM_SALT_LEN
);
638 OPENSSL_cleanse(vf
, vfsize
);
646 * create a verifier (*salt,*verifier,g and N are BIGNUMs). If *salt != NULL
647 * then the provided salt will be used. On successful exit *verifier will point
648 * to a newly allocated BIGNUM containing the verifier and (if a salt was not
649 * provided) *salt will be populated with a newly allocated BIGNUM containing a
651 * The caller is responsible for freeing the allocated *salt and *verifier
654 int SRP_create_verifier_BN(const char *user
, const char *pass
, BIGNUM
**salt
,
655 BIGNUM
**verifier
, BIGNUM
*N
, BIGNUM
*g
)
659 BN_CTX
*bn_ctx
= BN_CTX_new();
660 unsigned char tmp2
[MAX_LEN
];
661 BIGNUM
*salttmp
= NULL
;
663 if ((user
== NULL
) ||
666 (verifier
== NULL
) || (N
== NULL
) || (g
== NULL
) || (bn_ctx
== NULL
))
673 if (RAND_pseudo_bytes(tmp2
, SRP_RANDOM_SALT_LEN
) < 0)
676 salttmp
= BN_bin2bn(tmp2
, SRP_RANDOM_SALT_LEN
, NULL
);
681 x
= SRP_Calc_x(salttmp
, user
, pass
);
683 *verifier
= BN_new();
684 if (*verifier
== NULL
)
687 if (!BN_mod_exp(*verifier
, g
, x
, N
, bn_ctx
)) {
688 BN_clear_free(*verifier
);
692 srp_bn_print(*verifier
);
698 if (*salt
!= salttmp
)
699 BN_clear_free(salttmp
);