Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Remove lazy_static from dependencies #847

Merged
merged 2 commits into from
Dec 10, 2024
Merged

Remove lazy_static from dependencies #847

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
d791d0a
Remove lazy_static from dependencies
qsantos Dec 9, 2024
76b6368
Apply auto rustfmt
qsantos Dec 9, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 0 additions & 1 deletion Cargo.toml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,6 @@ version = "0.1.0"
authors = ["Anshul Malik <malikanshul29@gmail.com>"]

[dependencies]
lazy_static = "1.4.0"
num-bigint = { version = "0.4", optional = true }
num-traits = { version = "0.2", optional = true }
rand = "0.8"
Expand Down
115 changes: 59 additions & 56 deletions src/ciphers/diffie_hellman.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,57 +2,57 @@
// RFC 3526 - More Modular Exponential (MODP) Diffie-Hellman groups for
// Internet Key Exchange (IKE) https://tools.ietf.org/html/rfc3526

use lazy_static;
use num_bigint::BigUint;
use num_traits::{Num, Zero};
use std::{
collections::HashMap,
sync::LazyLock,
time::{SystemTime, UNIX_EPOCH},
};

// Using lazy static to initialize statics that require code to be executed at runtime.
lazy_static! {
// A map of predefined prime numbers for different bit lengths, as specified in RFC 3526
static ref PRIMES: HashMap<u8, BigUint> = {
let mut m:HashMap<u8, BigUint> = HashMap::new();
m.insert(
// 1536-bit
5,
BigUint::parse_bytes(
b"FFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD1\
29024E088A67CC74020BBEA63B139B22514A08798E3404DD\
EF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245\
E485B576625E7EC6F44C42E9A637ED6B0BFF5CB6F406B7ED\
EE386BFB5A899FA5AE9F24117C4B1FE649286651ECE45B3D\
C2007CB8A163BF0598DA48361C55D39A69163FA8FD24CF5F\
83655D23DCA3AD961C62F356208552BB9ED529077096966D\
670C354E4ABC9804F1746C08CA237327FFFFFFFFFFFFFFFF",
16
).unwrap()
);
m.insert(
// 2048-bit
14,
BigUint::parse_bytes(
b"FFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD1\
// A map of predefined prime numbers for different bit lengths, as specified in RFC 3526
static PRIMES: LazyLock<HashMap<u8, BigUint>> = LazyLock::new(|| {
let mut m: HashMap<u8, BigUint> = HashMap::new();
m.insert(
// 1536-bit
5,
BigUint::parse_bytes(
b"FFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD1\
29024E088A67CC74020BBEA63B139B22514A08798E3404DD\
EF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245\
E485B576625E7EC6F44C42E9A637ED6B0BFF5CB6F406B7ED\
EE386BFB5A899FA5AE9F24117C4B1FE649286651ECE45B3D\
C2007CB8A163BF0598DA48361C55D39A69163FA8FD24CF5F\
83655D23DCA3AD961C62F356208552BB9ED529077096966D\
670C354E4ABC9804F1746C08CA18217C32905E462E36CE3B\
E39E772C180E86039B2783A2EC07A28FB5C55DF06F4C52C9\
DE2BCBF6955817183995497CEA956AE515D2261898FA0510\
15728E5A8AACAA68FFFFFFFFFFFFFFFF",
16
).unwrap()
);
670C354E4ABC9804F1746C08CA237327FFFFFFFFFFFFFFFF",
16,
)
.unwrap(),
);
m.insert(
// 2048-bit
14,
BigUint::parse_bytes(
b"FFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD1\
29024E088A67CC74020BBEA63B139B22514A08798E3404DD\
EF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245\
E485B576625E7EC6F44C42E9A637ED6B0BFF5CB6F406B7ED\
EE386BFB5A899FA5AE9F24117C4B1FE649286651ECE45B3D\
C2007CB8A163BF0598DA48361C55D39A69163FA8FD24CF5F\
83655D23DCA3AD961C62F356208552BB9ED529077096966D\
670C354E4ABC9804F1746C08CA18217C32905E462E36CE3B\
E39E772C180E86039B2783A2EC07A28FB5C55DF06F4C52C9\
DE2BCBF6955817183995497CEA956AE515D2261898FA0510\
15728E5A8AACAA68FFFFFFFFFFFFFFFF",
16,
)
.unwrap(),
);

m.insert(
// 3072-bit
15,
BigUint::parse_bytes(
// 3072-bit
15,
BigUint::parse_bytes(
b"FFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD1\
29024E088A67CC74020BBEA63B139B22514A08798E3404DD\
EF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245\
Expand All @@ -69,13 +69,14 @@ lazy_static! {
F12FFA06D98A0864D87602733EC86A64521F2B18177B200C\
BBE117577A615D6C770988C0BAD946E208E24FA074E5AB31\
43DB5BFCE0FD108E4B82D120A93AD2CAFFFFFFFFFFFFFFFF",
16
).unwrap()
16,
)
.unwrap(),
);
m.insert(
// 4096-bit
16,
BigUint::parse_bytes(
// 4096-bit
16,
BigUint::parse_bytes(
b"FFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD1\
29024E088A67CC74020BBEA63B139B22514A08798E3404DD\
EF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245\
Expand All @@ -98,13 +99,14 @@ lazy_static! {
1F612970CEE2D7AFB81BDD762170481CD0069127D5B05AA9\
93B4EA988D8FDDC186FFB7DC90A6C08F4DF435C934063199\
FFFFFFFFFFFFFFFF",
16
).unwrap()
16,
)
.unwrap(),
);
m.insert(
// 6144-bit
17,
BigUint::parse_bytes(
// 6144-bit
17,
BigUint::parse_bytes(
b"FFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E08\
8A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B\
302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9\
Expand Down Expand Up @@ -133,15 +135,16 @@ lazy_static! {
B7C5DA76F550AA3D8A1FBFF0EB19CCB1A313D55CDA56C9EC2EF29632\
387FE8D76E3C0468043E8F663F4860EE12BF2D5B0B7474D6E694F91E\
6DCC4024FFFFFFFFFFFFFFFF",
16
).unwrap()
16,
)
.unwrap(),
);

m.insert(
// 8192-bit
18,
BigUint::parse_bytes(
b"FFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD1\
// 8192-bit
18,
BigUint::parse_bytes(
b"FFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD1\
29024E088A67CC74020BBEA63B139B22514A08798E3404DD\
EF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245\
E485B576625E7EC6F44C42E9A637ED6B0BFF5CB6F406B7ED\
Expand Down Expand Up @@ -184,12 +187,12 @@ lazy_static! {
4009438B481C6CD7889A002ED5EE382BC9190DA6FC026E47\
9558E4475677E9AA9E3050E2765694DFC81F56E880B96E71\
60C980DD98EDD3DFFFFFFFFFFFFFFFFF",
16
).unwrap()
16,
)
.unwrap(),
);
m
};
}
});

/// Generating random number, should use num_bigint::RandomBits if possible.
fn rand() -> usize {
Expand Down
2 changes: 0 additions & 2 deletions src/lib.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,3 @@
#[macro_use]
extern crate lazy_static;
pub mod backtracking;
pub mod big_integer;
pub mod bit_manipulation;
Expand Down
Loading