mirror of
https://github.com/cryb-to/cryb-to.git
synced 2024-11-15 02:05:40 +00:00
96 lines
2.8 KiB
C
96 lines
2.8 KiB
C
/*-
|
|
* Copyright (c) 2012-2013 The University of Oslo
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. The name of the author may not be used to endorse or promote
|
|
* products derived from this software without specific prior written
|
|
* permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#include "cryb/impl.h"
|
|
|
|
#include <stdint.h>
|
|
#include <string.h>
|
|
#include <time.h>
|
|
|
|
#include <cryb/oath.h>
|
|
|
|
#define TOTP_TIME_STEP 30
|
|
|
|
unsigned int
|
|
oath_totp(const uint8_t *K, size_t Klen, unsigned int Digit)
|
|
{
|
|
time_t now;
|
|
|
|
time(&now);
|
|
return (oath_hotp(K, Klen, now / TOTP_TIME_STEP, Digit));
|
|
}
|
|
|
|
unsigned int
|
|
oath_totp_current(const struct oath_key *k)
|
|
{
|
|
unsigned int code;
|
|
uint64_t seq;
|
|
|
|
if (k == NULL)
|
|
return (-1);
|
|
if (k->mode != om_totp)
|
|
return (-1);
|
|
if (k->timestep == 0)
|
|
return (-1);
|
|
seq = time(NULL) / k->timestep;
|
|
code = oath_hotp(k->key, k->keylen, seq, k->digits);
|
|
return (code);
|
|
}
|
|
|
|
/*
|
|
* Compares the code provided by the user with expected values within a
|
|
* given window. Returns 1 if there was a match, 0 if not, and -1 if an
|
|
* error occurred.
|
|
*/
|
|
int
|
|
oath_totp_match(struct oath_key *k, unsigned int response, int window)
|
|
{
|
|
unsigned int code;
|
|
uint64_t seq;
|
|
|
|
if (k == NULL)
|
|
return (-1);
|
|
if (window < 1)
|
|
return (-1);
|
|
if (k->mode != om_totp)
|
|
return (-1);
|
|
if (k->timestep == 0)
|
|
return (-1);
|
|
seq = time(NULL) / k->timestep;
|
|
for (int i = -window; i <= window; ++i) {
|
|
if (seq + i <= k->lastused)
|
|
continue;
|
|
code = oath_hotp(k->key, k->keylen, seq + i, k->digits);
|
|
if (code == response && !k->dummy) {
|
|
k->lastused = seq;
|
|
return (1);
|
|
}
|
|
}
|
|
return (0);
|
|
}
|