Struct HOTP

pub struct HOTP { /* private fields */ }

Two-step verfication of HOTP algorithm.

Implementations

impl HOTP

pub fn new<S: Into<String>>(secret: S) -> HOTP

Constructs a new HOTP

pub fn from_base32<S: Into<String>>(secret: S) -> Option<HOTP>

Constructs a new HOTP with base-32 encoded secret bytes

pub fn from_bytes(bytes: &[u8]) -> HOTP

Constructs a new HOTP with secret bytes

pub fn generate(&self, counter: u64) -> u32

Generate a HOTP code.

counter: HOTP is a counter based algorithm.

pub fn verify(&self, code: u32, last: u64, trials: u64) -> bool

Valid a HOTP code.

code: A number that is less than 6 characters.

last: Guess HOTP code from last + 1 range.

trials: Guess HOTP code end at last + trials + 1.

pub fn base32_secret(&self) -> String

Return the secret bytes in base32 encoding.

pub fn to_uri<S: AsRef<str>>(&self, label: S, issuer: S, counter: u64) -> String

Generate the otpauth protocal string.

label: Label of the identifier.

issuer: The company, the organization or something else.

counter: Counter of the HOTP algorithm.

Trait Implementations

impl Clone for HOTP

fn clone(&self) -> HOTP

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for HOTP

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for HOTP

fn eq(&self, other: &HOTP) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for HOTP

impl StructuralPartialEq for HOTP