@@ -3,8 +3,8 @@ use num_bigint::Sign::Plus;
33use num_bigint:: { BigInt , BigUint } ;
44use num_traits:: { FromPrimitive , One } ;
55use rand:: { rngs:: ThreadRng , Rng } ;
6- #[ cfg( feature = "serde1 " ) ]
7- use serde :: { Deserialize , Serialize } ;
6+ #[ cfg( feature = "serde " ) ]
7+ use serde_crate :: { Deserialize , Serialize } ;
88use zeroize:: Zeroize ;
99
1010use crate :: algorithms:: generate_multi_prime_key;
@@ -20,15 +20,15 @@ lazy_static! {
2020
2121/// Represents the public part of an RSA key.
2222#[ 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" ) ) ]
2424pub struct RSAPublicKey {
2525 n : BigUint ,
2626 e : BigUint ,
2727}
2828
2929/// Represents a whole RSA key, public and private parts.
3030#[ derive( Debug , Clone ) ]
31- #[ cfg_attr( feature = "serde1 " , derive( Serialize , Deserialize ) ) ]
31+ #[ cfg_attr( feature = "serde " , derive( Serialize , Deserialize ) , serde ( crate = "serde_crate" ) ) ]
3232pub struct RSAPrivateKey {
3333 /// Modulus
3434 n : BigUint ,
@@ -39,7 +39,7 @@ pub struct RSAPrivateKey {
3939 /// Prime factors of N, contains >= 2 elements.
4040 primes : Vec < BigUint > ,
4141 /// precomputed values to speed up private operations
42- #[ cfg_attr( feature = "serde1 " , serde( skip) ) ]
42+ #[ cfg_attr( feature = "serde " , serde( skip) ) ]
4343 pub ( crate ) precomputed : Option < PrecomputedValues > ,
4444}
4545
0 commit comments