Crypt::ECDSA::UtilCrypt::ECDSA::Util is a Perl module with utility functions for Crypt::ECDSA. | |
Download |
Crypt::ECDSA::Util Ranking & Summary
Advertisement
- License:
- Perl Artistic License
- Price:
- FREE
- Publisher Name:
- William Herrera
- Publisher web site:
- http://search.cpan.org/~billh/
Crypt::ECDSA::Util Tags
Crypt::ECDSA::Util Description
Crypt::ECDSA::Util is a Perl module with utility functions for Crypt::ECDSA. Crypt::ECDSA::Util is a Perl module with utility functions for Crypt::ECDSA.METHODSbint bint( $scalar ); Mostly a shortcut for Math::GMPz->new( ). Makes a new Math::GMPz type bigint arbitrary sized integer from a scalar argument or another bigint.two_pow my $two_to_the_power_of_n = two_pow( $n ); Returns a new bigint equal to 2 ** $n.bigint_from_coeff my irreducible = bigint_from_coeff( ); returns a bigint given a list of exponents for a polynomial of base 2, such that => 2**3 + 2**1 + 2**0 = 8 + 2 + 1is_probably_prime my $is_prime = is_probably_prime( $n ); Returns 1 if $n is almost certainly prime ( chancemake_pq_seed_counter_new my( $p, $q, $seed, $counter ) = make_pq_seed_counter_new( 2048, 256, 256 ); Make primes p and q for use in DSA algorithms, given L, N, and seed length. See FIPS PUB 186-3, 2006 (draft standard).make_seed_and_pq_with_sha1 my( $p, $q, $seed, $counter ) = make_seed_and_pq_with_sha1( 1024, 164 ); Make primes p and q for use in DSA algorithms, given L and seed length. See FIPS 186-2, the CURRENT standard. This is may be obsolete after 2008.Requirements:· Perl Requirements: · Perl
Crypt::ECDSA::Util Related Software