@@ -3,8 +3,8 @@ use num_bigint::Sign::Plus;
3
3
use num_bigint:: { BigInt , BigUint } ;
4
4
use num_traits:: { FromPrimitive , One } ;
5
5
use rand:: { rngs:: ThreadRng , Rng } ;
6
- #[ cfg( feature = "serde1 " ) ]
7
- use serde :: { Deserialize , Serialize } ;
6
+ #[ cfg( feature = "serde " ) ]
7
+ use serde_crate :: { Deserialize , Serialize } ;
8
8
use zeroize:: Zeroize ;
9
9
10
10
use crate :: algorithms:: generate_multi_prime_key;
@@ -20,15 +20,15 @@ lazy_static! {
20
20
21
21
/// Represents the public part of an RSA key.
22
22
#[ derive( Debug , Clone , PartialEq , Eq ) ]
23
- #[ cfg_attr( feature = "serde1 " , derive( Serialize , Deserialize ) ) ]
23
+ #[ cfg_attr( feature = "serde " , derive( Serialize , Deserialize ) , serde ( crate = "serde_crate" ) ) ]
24
24
pub struct RSAPublicKey {
25
25
n : BigUint ,
26
26
e : BigUint ,
27
27
}
28
28
29
29
/// Represents a whole RSA key, public and private parts.
30
30
#[ derive( Debug , Clone ) ]
31
- #[ cfg_attr( feature = "serde1 " , derive( Serialize , Deserialize ) ) ]
31
+ #[ cfg_attr( feature = "serde " , derive( Serialize , Deserialize ) , serde ( crate = "serde_crate" ) ) ]
32
32
pub struct RSAPrivateKey {
33
33
/// Modulus
34
34
n : BigUint ,
@@ -39,7 +39,7 @@ pub struct RSAPrivateKey {
39
39
/// Prime factors of N, contains >= 2 elements.
40
40
primes : Vec < BigUint > ,
41
41
/// precomputed values to speed up private operations
42
- #[ cfg_attr( feature = "serde1 " , serde( skip) ) ]
42
+ #[ cfg_attr( feature = "serde " , serde( skip) ) ]
43
43
pub ( crate ) precomputed : Option < PrecomputedValues > ,
44
44
}
45
45
0 commit comments