#!perl use strict; use warnings; use Time::HiRes 'time'; use Crypt::Argon2; sub prompt { my ($mess, $def) = @_; my $dispdef = defined $def ? ("[$def] " ) : ''; local $| = 1; print "$mess ", $dispdef; my $ans = ; chomp $ans; if (not defined $ans or not length $ans) { $ans = defined $def ? $def : ''; } return $ans; } my %encoder = ( argon2id => \&Crypt::Argon2::argon2id_raw, argon2i => \&Crypt::Argon2::argon2i_raw, argon2d => \&Crypt::Argon2::argon2d_raw, ); my $type = prompt('What type of hash?', 'argon2id'); my $encoder = $encoder{$type} or die "Invalid type $type"; my $threads = prompt('How many threads may it use', 1); die "Invalid number '$threads'" unless $threads > 0; my $mem_cost = prompt('How much memory may it use (e.g. 32M)'); die "Invalid memory usage '$mem_cost'" unless $mem_cost =~ / ^ \d+ [hMG] $ /x; my $max_time = prompt('How much time may argon2 take? (in milliseconds)'); die 'No time given' unless $max_time > 0; my $begin = time; $encoder->("correct horse battery staple", scalar("\x00" x 16), 100, $mem_cost, $threads, 16); my $end = time; my $time_per_round = ($end - $begin) * 10; my $time_cost = int($max_time / $time_per_round); die "Can't compute a hash in the given time (took $time_per_round milliseconds)" if $time_cost == 0; die "Unsafe parameters were computed" if $type eq 'argon2i' && $time_cost < 3; print <<"END"; type = $type threads = $threads mem_cost = $mem_cost time_cost = $time_cost END # PODNAME: argon2-calibrate # ABSTRACT: a script to find the appropriate argon2 parameters __END__ =pod =encoding UTF-8 =head1 NAME argon2-calibrate - a script to find the appropriate argon2 parameters =head1 VERSION version 0.031 =head1 DESCRIPTION This program implements the following procedure, as recommended by the argon2 authors: =over 4 =item 1. Select the type C. If you do not know the difference between them, choose Argon2id. =item 2. Figure out the maximum number of threads C that can be initiated by each call to Argon2. This is the C argument. =item 3. Figure out the maximum amount of memory C that each call can a afford. =item 4. Figure out the maximum amount C of time (in seconds) that each call can a afford. =item 5. Select the salt length. 16 bytes is suffient for all applications, but can be reduced to 8 bytes in the case of space constraints. =item 6. Select the tag (output) size. 16 bytes is suffient for most applications, including key derivation. =item 7. Run the scheme of type C, memory C and C lanes and threads, using different number of passes C. Figure out the maximum C such that the running time does not exceed C. If it exceeds C even for C, reduce C accordingly. If using Argon2i, t must be at least 3. =item 8. Hash all the passwords with the just determined values C, C, and C. =back =head1 AUTHOR Leon Timmermans =head1 COPYRIGHT AND LICENSE This software is Copyright (c) 2013 by Daniel Dinu, Dmitry Khovratovich, Jean-Philippe Aumasson, Samuel Neves, Thomas Pornin and Leon Timmermans. This is free software, licensed under: The Apache License, Version 2.0, January 2004 =cut