openssl/doc/crypto/DSA_size.pod

=pod

=head1 NAME

DSA_size - get DSA signature size

=head1 SYNOPSIS

 #include <openssl/dsa.h>

 int DSA_size(const DSA *dsa);

=head1 DESCRIPTION

This function returns the size of an ASN.1 encoded DSA signature in
bytes. It can be used to determine how much memory must be allocated
for a DSA signature.

B<dsa-E<gt>q> must not be B<NULL>.

=head1 RETURN VALUE

The size in bytes.

=head1 SEE ALSO

L<dsa(3)>, L<DSA_sign(3)>

=cut
Document DSA and SHA. New function BN_pseudo_rand(). Use BN_prime_checks_size(BN_num_bits(w)) rounds of Miller-Rabin when generating DSA primes (why not use BN_is_prime()?) 2000-01-28 03:31:26 +08:00			`=pod`

			`=head1 NAME`

nicer manpages 2000-02-24 19:55:57 +08:00			`DSA_size - get DSA signature size`
Document DSA and SHA. New function BN_pseudo_rand(). Use BN_prime_checks_size(BN_num_bits(w)) rounds of Miller-Rabin when generating DSA primes (why not use BN_is_prime()?) 2000-01-28 03:31:26 +08:00
			`=head1 SYNOPSIS`

			`#include <openssl/dsa.h>`

These are updates/fixes to DH/DSA/RAND docs based on the fixes to the RSA docs. There were a couple of other places (including RSA) where the docs were not quite synchronised with the API that are now fixed. One or two still remain to be fixed though ... 2002-08-06 00:27:01 +08:00			`int DSA_size(const DSA *dsa);`
Document DSA and SHA. New function BN_pseudo_rand(). Use BN_prime_checks_size(BN_num_bits(w)) rounds of Miller-Rabin when generating DSA primes (why not use BN_is_prime()?) 2000-01-28 03:31:26 +08:00
			`=head1 DESCRIPTION`

			`This function returns the size of an ASN.1 encoded DSA signature in`
			`bytes. It can be used to determine how much memory must be allocated`
			`for a DSA signature.`

			`B<dsa-E<gt>q> must not be B<NULL>.`

			`=head1 RETURN VALUE`

			`The size in bytes.`

			`=head1 SEE ALSO`

Fix L<> content in manpages L<foo\|foo> is sub-optimal If the xref is the same as the title, which is what we do, then you only need L<foo>. This fixes all 1457 occurrences in 349 files. Approximately. (And pod used to need both.) Reviewed-by: Richard Levitte <levitte@openssl.org> 2015-08-18 03:21:33 +08:00			`L<dsa(3)>, L<DSA_sign(3)>`
Document DSA and SHA. New function BN_pseudo_rand(). Use BN_prime_checks_size(BN_num_bits(w)) rounds of Miller-Rabin when generating DSA primes (why not use BN_is_prime()?) 2000-01-28 03:31:26 +08:00
			`=cut`