blib/lib/Crypt/Perl/ECDSA/Utils.pm untested

filter: Statementstmt 0.0% 0 / 46 Branchbran 0.0% 0 / 16 Conditioncond n/a MC/DCmcdc n/a Subroutinesub 0.0% 0 / 8 Podpod 0.0% 0 / 4 totaltotal 0.0% 0 / 74 CC 9 SCAR 25.6
CC
9
Cov
0%
split_G_or_public
20.0
decompress_point
20.0
compress_point
12.0
CRAP 12.9
1 package Crypt::Perl::ECDSA::Utils;
2  
3 =encoding utf-8
4  
5 =head1 NAME
6  
7 Crypt::Perl::ECDSA::Utils
8  
9 =head1 DISCUSSION
10  
11 This interface is undocumented for now.
12  
13 =cut
14  
15 use strict;
16 use warnings;
17  
18 use Crypt::Perl::ECDSA::Math ();
19 use Crypt::Perl::X ();
20  
21 #Splits the combined (uncompressed) generator or the public key
22 #into its two component halves (octet strings).
23 sub split_G_or_public {
24 my ($bytes_str) = @_;
25  
26 die Crypt::Perl::X::create('Generic', "Only bytes, not “$bytes_str”!") if ref $bytes_str;
27  
28 my $gen_prefix = ord( substr $bytes_str, 0, 1);
29  
30 if ( $gen_prefix ne 0x04 ) {
31 die Crypt::Perl::X::create('Generic', "Unrecognized generator or public key prefix/type ($gen_prefix)!");
32 }
33  
34 #Should never happen, but.
35 if ( !(length($bytes_str) % 2) ) {
36 die Crypt::Perl::X::create('Generic', "Invalid generator or public key: length must be uneven" );
37 }
38  
39 my $len = (length($bytes_str) - 1) / 2;
40  
41 return unpack( "x a$len a$len", $bytes_str );
42 }
43  
44 sub compress_point {
45 my ($pub_bin) = @_;
46  
47 if (substr($pub_bin, 0, 1) ne "\x04") {
48 die( sprintf "Invalid point to compress: %v.02x", $pub_bin );
49 }
50  
51 my $first_octet = (ord( substr $pub_bin, -1 ) % 2) ? "\x03" : "\x02";
52  
53 my ($xb) = split_G_or_public( $pub_bin );
54  
55 return( $first_octet . $xb );
56 }
57  
58 #$pub_bin is a string; $p/$a/$b are BigInt
59 #returns a string
60 sub decompress_point {
61 my ($cpub_bin, $p, $a, $b) = @_;
62  
63 my $y_is_even = 0;
64 my $octet1 = substr($cpub_bin, 0, 1);
65 if ($octet1 eq "\x02") {
66 $y_is_even = 1;
67 }
68 elsif ($octet1 ne "\x03") {
69 die( sprintf "Invalid point to decompress: %v.02x", $cpub_bin );
70 }
71  
72 #http://stackoverflow.com/questions/17171542/algorithm-for-elliptic-curve-point-compression
73 my $a_p = $a->copy()->bsub($p);
74  
75 my $x = Crypt::Perl::BigInt->from_bytes(substr $cpub_bin, 1);
76 my $y = $x->copy()->bmodpow(3, $p);
77  
78 my $t2 = $x->copy()->bmul($a)->bmod($p);
79 $y->badd($t2)->badd($b);
80 $y = Crypt::Perl::ECDSA::Math::tonelli_shanks( $y, $p );
81  
82 if (!!$y_is_even eq !!$y->is_odd()) {
83 $y->bsub($p)->bneg();
84 }
85  
86 return join(
87 q<>,
88 "\x04",
89 pad_bytes_for_asn1(substr($cpub_bin, 1), $p),
90 pad_bytes_for_asn1($y->as_bytes(), $p),
91 );
92 }
93  
94 sub pad_bytes_for_asn1 {
95 my ($bytes, $p) = @_;
96  
97 my $nbytes = length $p->as_bytes();
98  
99 substr( $bytes, 0, 0 ) = ("\0" x ($nbytes - length $bytes));
100  
101 return $bytes;
102 }
103  
104 1;