|
1 | 1 | //! Elliptic Curve Digital Signature Algorithm (ECDSA) private keys. |
2 | 2 |
|
3 | | -use crate::{Algorithm, EcdsaCurve, Error, Result, public::EcdsaPublicKey}; |
| 3 | +use crate::{public::EcdsaPublicKey, Algorithm, EcdsaCurve, Error, Result}; |
4 | 4 | use core::fmt; |
5 | 5 | use encoding::{CheckedSum, Decode, Encode, Reader, Writer}; |
6 | 6 | use sec1::consts::{U32, U48, U66}; |
@@ -39,27 +39,26 @@ impl<const SIZE: usize> Decode for EcdsaPrivateKey<SIZE> { |
39 | 39 |
|
40 | 40 | fn decode(reader: &mut impl Reader) -> Result<Self> { |
41 | 41 | reader.read_prefixed(|reader| { |
42 | | - let len = reader.remaining_len(); |
| 42 | + let mut len = reader.remaining_len(); |
| 43 | + |
43 | 44 | if len == SIZE.checked_add(1).ok_or(encoding::Error::Length)? { |
44 | 45 | // Strip leading zero |
45 | 46 | // TODO(tarcieri): make sure leading zero was necessary |
46 | 47 | if u8::decode(reader)? != 0 { |
47 | 48 | return Err(Error::FormatEncoding); |
48 | 49 | } |
| 50 | + |
| 51 | + len -= 1; |
49 | 52 | } |
50 | 53 |
|
51 | | - let mut bytes = [0u8; SIZE]; |
52 | | - if SIZE == 66 { |
53 | | - // https://stackoverflow.com/questions/50002149/why-p-521-public-key-x-y-some-time-is-65-bytes-some-time-is-66-bytes |
54 | | - // although lower keys than 64 are vanishingly possible, but lets stop here |
55 | | - if len > 63 { |
56 | | - reader.read(&mut bytes[..core::cmp::min(len, SIZE)])?; |
57 | | - } else { |
58 | | - return Err(encoding::Error::Length.into()); |
59 | | - } |
60 | | - } else { |
61 | | - reader.read(&mut bytes)?; |
| 54 | + // Minimum allowed key size: may be smaller than modulus size |
| 55 | + const MIN_SIZE: usize = 32; |
| 56 | + if len < MIN_SIZE || len > SIZE { |
| 57 | + return Err(encoding::Error::Length.into()); |
62 | 58 | } |
| 59 | + |
| 60 | + let mut bytes = [0u8; SIZE]; |
| 61 | + reader.read(&mut bytes[..len])?; |
63 | 62 | Ok(Self { bytes }) |
64 | 63 | }) |
65 | 64 | } |
|
0 commit comments