Pod::Spec.new do |s|

s.name = "EntropyString"

s.summary = "Efficiently generate cryptographically strong random strings of specified entropy from various character sets."

s.description = <<-DESC

static let bitsPerByte: UInt8 = 8

private static let log2_10: Float = log2(10)

/// Powers of ten

public enum Power: UInt {

case ten01 = 1,

ten02, ten03, ten04, ten05, ten06, ten07, ten08, ten09, ten10, ten11,

///

/// - return: Bits of entropy required to cover the *risk* of repeat in *total* items.

public static func bits(for numStrings: Float , risk: Float) -> Float {

}

/// Calculates required bits of entropy

/// - parameter risk: Accepted probability expressed as 1 in *10^risk* chance of repeat

///

/// - return: Bits of entropy required to cover the *risk* of repeat in *total* items.

public static func bits(for numStrings: Float, risk: Power) -> Float {

let log2Risk = Float(risk.rawValue) * log2_10

return total(numStrings: numStrings, log2Risk: log2Risk)

/// - parameter risk: Accepted probability expressed as 1 in *risk* chance of repeat

///

/// - return: Bits of entropy required to cover the *risk* of repeat in *total* items.

public static func bits(for numStrings: Power, risk: Power) -> Float {

if numStrings < .ten05 {

return bits(for: powf(10, Float(numStrings.rawValue)), risk: risk)

}

}

private static func total(numStrings: Float, log2Risk: Float) -> Float {

guard 0 < numStrings else { return 0 }

let N = numStrings < 10001 ? log2(Float(numStrings)) + log2(Float(numStrings-1)) : 2 * log2(Float(numStrings))

}

}

}

extension RandomTests {