Upload C-to-Rust data pairs
Browse files- deltachat-core.jsonl +0 -0
- incubator-milagro-crypto.jsonl +20 -0
deltachat-core.jsonl
ADDED
|
The diff for this file is too large to render.
See raw diff
|
|
|
incubator-milagro-crypto.jsonl
ADDED
|
@@ -0,0 +1,20 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/ecdh_support.c", "c_func": "void KDF2(int sha,const octet *z,const octet *p,int olen,octet *key)\n{\n /* NOTE: the parameter olen is the length of the output k in bytes */\n char h[64];\n octet H= {0,sizeof(h),h};\n int cthreshold;\n int hlen=sha;\n\n OCT_empty(key);\n\n cthreshold=ROUNDUP(olen,hlen);\n\n for (int counter=1; counter<=cthreshold; counter++)\n {\n ehashit(sha,z,counter,p,&H,0);\n if (key->len+hlen>olen) OCT_jbytes(key,H.val,olen%hlen);\n else OCT_joctet(key,&H);\n }\n\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/ecdh.rs", "rust_func": "pub fn kdf2(sha: usize, z: &[u8], p: Option<&[u8]>, olen: usize, k: &mut [u8]) {\n // NOTE: the parameter olen is the length of the output K in bytes\n let hlen = sha;\n let mut lk = 0;\n\n let mut cthreshold = olen / hlen;\n if olen % hlen != 0 {\n cthreshold += 1\n }\n\n for counter in 1..=cthreshold {\n let mut b: [u8; 64] = [0; 64];\n hashit(sha, z, counter, p, 0, &mut b);\n if lk + hlen > olen {\n for i in 0..(olen % hlen) {\n k[lk] = b[i];\n lk += 1\n }\n } else {\n for i in 0..hlen {\n k[lk] = b[i];\n lk += 1\n }\n }\n }\n}", "rust_context": "fn hashit(sha: usize, a: &[u8], n: usize, b: Option<&[u8]>, pad: usize, w: &mut [u8]) {\n let mut r: [u8; 64] = [0; 64];\n if sha == SHA256 {\n let mut h = HASH256::new();\n h.process_array(a);\n if n > 0 {\n h.process_num(n as i32)\n }\n if let Some(x) = b {\n h.process_array(x);\n }\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n }\n if sha == SHA384 {\n let mut h = HASH384::new();\n h.process_array(a);\n if n > 0 {\n h.process_num(n as i32)\n }\n if let Some(x) = b {\n h.process_array(x);\n }\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n }\n if sha == SHA512 {\n let mut h = HASH512::new();\n h.process_array(a);\n if n > 0 {\n h.process_num(n as i32)\n }\n if let Some(x) = b {\n h.process_array(x);\n }\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n }\n\n if pad == 0 {\n for i in 0..sha {\n w[i] = r[i]\n }\n } else {\n if pad <= sha {\n for i in 0..pad {\n w[i] = r[i]\n }\n } else {\n for i in 0..sha {\n w[i + pad - sha] = r[i]\n }\n for i in 0..(pad - sha) {\n w[i] = 0\n }\n }\n }\n}", "rust_imports": "use super::big;\nuse super::big::Big;\nuse super::ecp;\nuse super::ecp::ECP;\nuse super::rom;\nuse crate::aes;\nuse crate::aes::AES;\nuse crate::hash256::HASH256;\nuse crate::hash384::HASH384;\nuse crate::hash512::HASH512;\nuse crate::rand::RAND;\nuse super::*;\nuse crate::test_utils::*;\nuse crate::types::CurveType;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__ecdh__.rs__function__4.txt"}
|
| 2 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/pbc_support.c", "c_func": "unsign32 today(void)\n{\n /* return time in slots since epoch */\n unsign32 ti=(unsign32)time(NULL);\n return ti/(60*TIME_SLOT_MINUTES);\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/mpin256.rs", "rust_func": "pub fn today() -> usize {\n return (SystemTime::now()\n .duration_since(UNIX_EPOCH)\n .unwrap()\n .as_secs()\n / (60 * 1440)) as usize;\n}", "rust_context": "", "rust_imports": "use std::time::SystemTime;\nuse std::time::UNIX_EPOCH;\nuse super::big;\nuse super::big::Big;\nuse super::ecp;\nuse super::ecp::ECP;\nuse super::ecp8::ECP8;\nuse super::fp16::FP16;\nuse super::fp48::FP48;\nuse super::pair256;\nuse super::rom;\nuse crate::hash256::HASH256;\nuse crate::hash384::HASH384;\nuse crate::hash512::HASH512;\nuse crate::rand::RAND;\nuse super::*;\nuse crate::test_utils::*;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__mpin256__.rs__function__3.txt"}
|
| 3 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/pbc_support.c", "c_func": "void HASH_ALL(int sha,const octet *HID,const octet *xID,const octet *xCID,const octet *SEC,const octet *Y,const octet *R,const octet *W,octet *H)\n{\n char t[1284]; // assumes max modulus of 1024-bits\n octet T= {0,sizeof(t),t};\n\n OCT_joctet(&T,HID);\n if (xCID!=NULL) OCT_joctet(&T,xCID);\n else OCT_joctet(&T,xID);\n OCT_joctet(&T,SEC);\n OCT_joctet(&T,Y);\n OCT_joctet(&T,R);\n OCT_joctet(&T,W);\n\n mhashit(sha,0,&T,H);\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/mpin192.rs", "rust_func": "pub fn hash_all(\n sha: usize,\n hid: &[u8],\n xid: &[u8],\n xcid: Option<&[u8]>,\n sec: &[u8],\n y: &[u8],\n r: &[u8],\n w: &[u8],\n h: &mut [u8],\n) -> bool {\n let mut tlen: usize = 0;\n const RM: usize = big::MODBYTES as usize;\n let mut t: [u8; 10 * RM + 4] = [0; 10 * RM + 4];\n\n for i in 0..hid.len() {\n t[i] = hid[i]\n }\n tlen += hid.len();\n\n if let Some(rxcid) = xcid {\n for i in 0..rxcid.len() {\n t[i + tlen] = rxcid[i]\n }\n tlen += rxcid.len();\n } else {\n for i in 0..xid.len() {\n t[i + tlen] = xid[i]\n }\n tlen += xid.len();\n }\n\n for i in 0..sec.len() {\n t[i + tlen] = sec[i]\n }\n tlen += sec.len();\n for i in 0..y.len() {\n t[i + tlen] = y[i]\n }\n tlen += y.len();\n for i in 0..r.len() {\n t[i + tlen] = r[i]\n }\n tlen += r.len();\n for i in 0..w.len() {\n t[i + tlen] = w[i]\n }\n tlen += w.len();\n if tlen != 10 * RM + 4 {\n return false;\n }\n\n return hashit(sha, 0, &t, h);\n}", "rust_context": "fn hashit(sha: usize, n: usize, id: &[u8], w: &mut [u8]) -> bool {\n let mut r: [u8; 64] = [0; 64];\n let mut didit = false;\n if sha == SHA256 {\n let mut h = HASH256::new();\n if n > 0 {\n h.process_num(n as i32)\n }\n h.process_array(id);\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n didit = true;\n }\n if sha == SHA384 {\n let mut h = HASH384::new();\n if n > 0 {\n h.process_num(n as i32)\n }\n h.process_array(id);\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n didit = true;\n }\n if sha == SHA512 {\n let mut h = HASH512::new();\n if n > 0 {\n h.process_num(n as i32)\n }\n h.process_array(id);\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n didit = true;\n }\n if !didit {\n return false;\n }\n\n let rm = big::MODBYTES as usize;\n\n if sha > rm {\n for i in 0..rm {\n w[i] = r[i]\n }\n } else {\n for i in 0..sha {\n w[i + rm - sha] = r[i]\n }\n for i in 0..(rm - sha) {\n w[i] = 0\n }\n }\n\n return true;\n}", "rust_imports": "use std::time::SystemTime;\nuse std::time::UNIX_EPOCH;\nuse super::big;\nuse super::big::Big;\nuse super::ecp;\nuse super::ecp::ECP;\nuse super::ecp4::ECP4;\nuse super::fp24::FP24;\nuse super::fp8::FP8;\nuse super::pair192;\nuse super::rom;\nuse crate::hash256::HASH256;\nuse crate::hash384::HASH384;\nuse crate::hash512::HASH512;\nuse crate::rand::RAND;\nuse super::*;\nuse crate::test_utils::*;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__mpin192__.rs__function__27.txt"}
|
| 4 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/rsa_support.c", "c_func": "int OAEP_ENCODE(int sha,const octet *m,csprng *RNG,const octet *p,octet *f)\n{\n int slen;\n int olen=f->max-1;\n int mlen=m->len;\n int hlen;\n int seedlen;\n char dbmask[MAX_RSA_BYTES];\n char seed[64];\n octet DBMASK= {0,sizeof(dbmask),dbmask};\n octet SEED= {0,sizeof(seed),seed};\n\n hlen=seedlen=sha;\n if (mlen>olen-hlen-seedlen-1) return 1;\n if (m==f) return 1; /* must be distinct octets */\n\n hashit(sha,p,-1,f);\n\n slen=olen-mlen-hlen-seedlen-1;\n\n OCT_jbyte(f,0,slen);\n OCT_jbyte(f,0x1,1);\n OCT_joctet(f,m);\n\n OCT_rand(&SEED,RNG,seedlen);\n\n MGF1(sha,&SEED,olen-seedlen,&DBMASK);\n\n OCT_xor(&DBMASK,f);\n MGF1(sha,&DBMASK,seedlen,f);\n\n OCT_xor(f,&SEED);\n\n OCT_joctet(f,&DBMASK);\n\n OCT_pad(f,f->max);\n OCT_clear(&SEED);\n OCT_clear(&DBMASK);\n\n return 0;\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/rsa.rs", "rust_func": "pub fn oaep_encode(sha: usize, m: &[u8], rng: &mut RAND, p: Option<&[u8]>, f: &mut [u8]) -> bool {\n let olen = RFS - 1;\n let mlen = m.len();\n\n let hlen = sha;\n\n let mut seed: [u8; 64] = [0; 64];\n\n let seedlen = hlen;\n if mlen > olen - hlen - seedlen - 1 {\n return false;\n }\n\n let mut dbmask: [u8; RFS] = [0; RFS];\n\n hashit(sha, p, -1, f);\n let slen = olen - mlen - hlen - seedlen - 1;\n\n for i in 0..slen {\n f[hlen + i] = 0\n }\n f[hlen + slen] = 1;\n for i in 0..mlen {\n f[hlen + slen + 1 + i] = m[i]\n }\n\n for i in 0..seedlen {\n seed[i] = rng.getbyte()\n }\n\n mgf1(sha, &seed, olen - seedlen, &mut dbmask);\n\n for i in 0..olen - seedlen {\n dbmask[i] ^= f[i]\n }\n\n mgf1(sha, &dbmask[0..olen - seedlen], seedlen, f);\n\n for i in 0..seedlen {\n f[i] ^= seed[i]\n }\n\n for i in 0..olen - seedlen {\n f[i + seedlen] = dbmask[i]\n }\n\n /* pad to length RFS */\n let d = 1;\n for i in (d..RFS).rev() {\n f[i] = f[i - d];\n }\n for i in (0..d).rev() {\n f[i] = 0;\n }\n return true;\n}", "rust_context": "fn hashit(sha: usize, a: Option<&[u8]>, n: isize, w: &mut [u8]) {\n if sha == SHA256 {\n let mut h = HASH256::new();\n if let Some(x) = a {\n h.process_array(x);\n }\n if n >= 0 {\n h.process_num(n as i32)\n }\n let hs = h.hash();\n for i in 0..sha {\n w[i] = hs[i]\n }\n }\n if sha == SHA384 {\n let mut h = HASH384::new();\n if let Some(x) = a {\n h.process_array(x);\n }\n if n >= 0 {\n h.process_num(n as i32)\n }\n let hs = h.hash();\n for i in 0..sha {\n w[i] = hs[i]\n }\n }\n if sha == SHA512 {\n let mut h = HASH512::new();\n if let Some(x) = a {\n h.process_array(x);\n }\n if n >= 0 {\n h.process_num(n as i32)\n }\n let hs = h.hash();\n for i in 0..sha {\n w[i] = hs[i]\n }\n }\n}\n\npub fn mgf1(sha: usize, z: &[u8], olen: usize, k: &mut [u8]) {\n let hlen = sha;\n\n let mut j = 0;\n for i in 0..k.len() {\n k[i] = 0\n }\n\n let mut cthreshold = olen / hlen;\n if olen % hlen != 0 {\n cthreshold += 1\n }\n for counter in 0..cthreshold {\n let mut b: [u8; 64] = [0; 64];\n hashit(sha, Some(z), counter as isize, &mut b);\n\n if j + hlen > olen {\n for i in 0..(olen % hlen) {\n k[j] = b[i];\n j += 1\n }\n } else {\n for i in 0..hlen {\n k[j] = b[i];\n j += 1\n }\n }\n }\n}\n\npub fn getbyte(&mut self) -> u8 {\n let r = self.pool[self.pool_ptr];\n self.pool_ptr += 1;\n if self.pool_ptr >= 32 {\n self.fill_pool()\n }\n return u8::from(r);\n }\n\npub struct RAND {\n ira: [u32; RAND_NK], /* random number... */\n rndptr: usize,\n borrow: u32,\n pool_ptr: usize,\n pool: [u8; 32],\n}\n\npub const RFS: usize = (big::MODBYTES as usize) * ff::FFLEN;", "rust_imports": "use super::big;\nuse super::ff;\nuse super::ff::FF;\nuse crate::hash256::HASH256;\nuse crate::hash384::HASH384;\nuse crate::hash512::HASH512;\nuse crate::rand::RAND;\nuse super::*;\nuse crate::test_utils::*;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__rsa__.rs__function__7.txt"}
|
| 5 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/pbc_support.c", "c_func": "void HASH_ALL(int sha,const octet *HID,const octet *xID,const octet *xCID,const octet *SEC,const octet *Y,const octet *R,const octet *W,octet *H)\n{\n char t[1284]; // assumes max modulus of 1024-bits\n octet T= {0,sizeof(t),t};\n\n OCT_joctet(&T,HID);\n if (xCID!=NULL) OCT_joctet(&T,xCID);\n else OCT_joctet(&T,xID);\n OCT_joctet(&T,SEC);\n OCT_joctet(&T,Y);\n OCT_joctet(&T,R);\n OCT_joctet(&T,W);\n\n mhashit(sha,0,&T,H);\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/mpin.rs", "rust_func": "pub fn hash_all(\n sha: usize,\n hid: &[u8],\n xid: &[u8],\n xcid: Option<&[u8]>,\n sec: &[u8],\n y: &[u8],\n r: &[u8],\n w: &[u8],\n h: &mut [u8],\n) -> bool {\n let mut tlen: usize = 0;\n const RM: usize = big::MODBYTES as usize;\n let mut t: [u8; 10 * RM + 4] = [0; 10 * RM + 4];\n\n for i in 0..hid.len() {\n t[i] = hid[i]\n }\n tlen += hid.len();\n\n if let Some(rxcid) = xcid {\n for i in 0..rxcid.len() {\n t[i + tlen] = rxcid[i]\n }\n tlen += rxcid.len();\n } else {\n for i in 0..xid.len() {\n t[i + tlen] = xid[i]\n }\n tlen += xid.len();\n }\n\n for i in 0..sec.len() {\n t[i + tlen] = sec[i]\n }\n tlen += sec.len();\n for i in 0..y.len() {\n t[i + tlen] = y[i]\n }\n tlen += y.len();\n for i in 0..r.len() {\n t[i + tlen] = r[i]\n }\n tlen += r.len();\n for i in 0..w.len() {\n t[i + tlen] = w[i]\n }\n tlen += w.len();\n if tlen != 10 * RM + 4 {\n return false;\n }\n\n return hashit(sha, 0, &t, h);\n}", "rust_context": "fn hashit(sha: usize, n: usize, id: &[u8], w: &mut [u8]) -> bool {\n let mut r: [u8; 64] = [0; 64];\n let mut didit = false;\n if sha == SHA256 {\n let mut h = HASH256::new();\n if n > 0 {\n h.process_num(n as i32)\n }\n h.process_array(id);\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n didit = true;\n }\n if sha == SHA384 {\n let mut h = HASH384::new();\n if n > 0 {\n h.process_num(n as i32)\n }\n h.process_array(id);\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n didit = true;\n }\n if sha == SHA512 {\n let mut h = HASH512::new();\n if n > 0 {\n h.process_num(n as i32)\n }\n h.process_array(id);\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n didit = true;\n }\n if !didit {\n return false;\n }\n\n let rm = big::MODBYTES as usize;\n\n if sha > rm {\n for i in 0..rm {\n w[i] = r[i]\n }\n } else {\n for i in 0..sha {\n w[i + rm - sha] = r[i]\n }\n for i in 0..(rm - sha) {\n w[i] = 0\n }\n }\n\n return true;\n}", "rust_imports": "use std::time::SystemTime;\nuse std::time::UNIX_EPOCH;\nuse super::big;\nuse super::big::Big;\nuse super::ecp;\nuse super::ecp::ECP;\nuse super::ecp2::ECP2;\nuse super::fp12::FP12;\nuse super::fp4::FP4;\nuse super::pair;\nuse super::rom;\nuse crate::hash256::HASH256;\nuse crate::hash384::HASH384;\nuse crate::hash512::HASH512;\nuse crate::rand::RAND;\nuse super::*;\nuse crate::test_utils::*;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__mpin__.rs__function__27.txt"}
|
| 6 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/pbc_support.c", "c_func": "unsign32 today(void)\n{\n /* return time in slots since epoch */\n unsign32 ti=(unsign32)time(NULL);\n return ti/(60*TIME_SLOT_MINUTES);\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/mpin192.rs", "rust_func": "pub fn today() -> usize {\n return (SystemTime::now()\n .duration_since(UNIX_EPOCH)\n .unwrap()\n .as_secs()\n / (60 * 1440)) as usize;\n}", "rust_context": "", "rust_imports": "use std::time::SystemTime;\nuse std::time::UNIX_EPOCH;\nuse super::big;\nuse super::big::Big;\nuse super::ecp;\nuse super::ecp::ECP;\nuse super::ecp4::ECP4;\nuse super::fp24::FP24;\nuse super::fp8::FP8;\nuse super::pair192;\nuse super::rom;\nuse crate::hash256::HASH256;\nuse crate::hash384::HASH384;\nuse crate::hash512::HASH512;\nuse crate::rand::RAND;\nuse super::*;\nuse crate::test_utils::*;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__mpin192__.rs__function__3.txt"}
|
| 7 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/pbc_support.c", "c_func": "unsign32 today(void)\n{\n /* return time in slots since epoch */\n unsign32 ti=(unsign32)time(NULL);\n return ti/(60*TIME_SLOT_MINUTES);\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/mpin.rs", "rust_func": "pub fn today() -> usize {\n return (SystemTime::now()\n .duration_since(UNIX_EPOCH)\n .unwrap()\n .as_secs()\n / (60 * 1440)) as usize;\n}", "rust_context": "", "rust_imports": "use std::time::SystemTime;\nuse std::time::UNIX_EPOCH;\nuse super::big;\nuse super::big::Big;\nuse super::ecp;\nuse super::ecp::ECP;\nuse super::ecp2::ECP2;\nuse super::fp12::FP12;\nuse super::fp4::FP4;\nuse super::pair;\nuse super::rom;\nuse crate::hash256::HASH256;\nuse crate::hash384::HASH384;\nuse crate::hash512::HASH512;\nuse crate::rand::RAND;\nuse super::*;\nuse crate::test_utils::*;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__mpin__.rs__function__3.txt"}
|
| 8 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/ecdh_support.c", "c_func": "void PBKDF2(int sha,const octet *p,octet *s,int rep,int olen,octet *key)\n{\n int len;\n int d=ROUNDUP(olen,sha);\n char f[64];\n char u[64];\n octet F= {0,sizeof(f),f};\n octet U= {0,sizeof(u),u};\n OCT_empty(key);\n\n for (int i=1; i<=d; i++)\n {\n len=s->len;\n OCT_jint(s,i,4);\n\n HMAC(sha,s,p,sha,&F);\n\n s->len=len;\n OCT_copy(&U,&F);\n for (int j=2; j<=rep; j++)\n {\n HMAC(sha,&U,p,sha,&U);\n OCT_xor(&F,&U);\n }\n\n OCT_joctet(key,&F);\n }\n\n OCT_chop(key,NULL,olen);\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/ecdh.rs", "rust_func": "pub fn pbkdf2(sha: usize, pass: &[u8], salt: &[u8], rep: usize, olen: usize, k: &mut [u8]) {\n let mut d = olen / sha;\n if olen % sha != 0 {\n d += 1\n }\n let mut f: [u8; 64] = [0; 64];\n let mut u: [u8; 64] = [0; 64];\n let mut ku: [u8; 64] = [0; 64];\n let mut s: [u8; 36] = [0; 36]; // Maximum salt of 32 bytes + 4\n let mut n: [u8; 4] = [0; 4];\n\n let sl = salt.len();\n let mut kp = 0;\n for i in 0..d {\n for j in 0..sl {\n s[j] = salt[j]\n }\n intto_bytes(i + 1, &mut n);\n for j in 0..4 {\n s[sl + j] = n[j]\n }\n\n hmac(sha, &s[0..sl + 4], pass, sha, &mut f);\n\n for j in 0..sha {\n u[j] = f[j]\n }\n for _ in 1..rep {\n hmac(sha, &u, pass, sha, &mut ku);\n for k in 0..sha {\n u[k] = ku[k];\n f[k] ^= u[k]\n }\n }\n for j in 0..EFS {\n if kp < olen && kp < f.len() {\n k[kp] = f[j]\n }\n kp += 1\n }\n }\n}", "rust_context": "pub fn hmac(sha: usize, m: &[u8], k: &[u8], olen: usize, tag: &mut [u8]) -> bool {\n // Input is from an octet m\n // olen is requested output length in bytes. k is the key\n // The output is the calculated tag\n let mut b: [u8; 64] = [0; 64]; // Not good\n let mut k0: [u8; 128] = [0; 128];\n\n if olen < 4 {\n return false;\n }\n\n let mut lb = 64;\n if sha > 32 {\n lb = 128\n }\n\n for i in 0..lb {\n k0[i] = 0\n }\n\n if k.len() > lb {\n hashit(sha, k, 0, None, 0, &mut b);\n for i in 0..sha {\n k0[i] = b[i]\n }\n } else {\n for i in 0..k.len() {\n k0[i] = k[i]\n }\n }\n\n for i in 0..lb {\n k0[i] ^= 0x36\n }\n hashit(sha, &k0[0..lb], 0, Some(m), 0, &mut b);\n\n for i in 0..lb {\n k0[i] ^= 0x6a\n }\n hashit(sha, &k0[0..lb], 0, Some(&b[0..sha]), olen, tag);\n\n return true;\n}\n\nfn intto_bytes(n: usize, b: &mut [u8]) {\n let mut i = b.len();\n let mut m = n;\n while m > 0 && i > 0 {\n i -= 1;\n b[i] = (m & 0xff) as u8;\n m /= 256;\n }\n}", "rust_imports": "use super::big;\nuse super::big::Big;\nuse super::ecp;\nuse super::ecp::ECP;\nuse super::rom;\nuse crate::aes;\nuse crate::aes::AES;\nuse crate::hash256::HASH256;\nuse crate::hash384::HASH384;\nuse crate::hash512::HASH512;\nuse crate::rand::RAND;\nuse super::*;\nuse crate::test_utils::*;\nuse crate::types::CurveType;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__ecdh__.rs__function__5.txt"}
|
| 9 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/pbc_support.c", "c_func": "void HASH_ALL(int sha,const octet *HID,const octet *xID,const octet *xCID,const octet *SEC,const octet *Y,const octet *R,const octet *W,octet *H)\n{\n char t[1284]; // assumes max modulus of 1024-bits\n octet T= {0,sizeof(t),t};\n\n OCT_joctet(&T,HID);\n if (xCID!=NULL) OCT_joctet(&T,xCID);\n else OCT_joctet(&T,xID);\n OCT_joctet(&T,SEC);\n OCT_joctet(&T,Y);\n OCT_joctet(&T,R);\n OCT_joctet(&T,W);\n\n mhashit(sha,0,&T,H);\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/mpin256.rs", "rust_func": "pub fn hash_all(\n sha: usize,\n hid: &[u8],\n xid: &[u8],\n xcid: Option<&[u8]>,\n sec: &[u8],\n y: &[u8],\n r: &[u8],\n w: &[u8],\n h: &mut [u8],\n) -> bool {\n let mut tlen: usize = 0;\n const RM: usize = big::MODBYTES as usize;\n let mut t: [u8; 10 * RM + 4] = [0; 10 * RM + 4];\n\n for i in 0..hid.len() {\n t[i] = hid[i]\n }\n tlen += hid.len();\n\n if let Some(rxcid) = xcid {\n for i in 0..rxcid.len() {\n t[i + tlen] = rxcid[i]\n }\n tlen += rxcid.len();\n } else {\n for i in 0..xid.len() {\n t[i + tlen] = xid[i]\n }\n tlen += xid.len();\n }\n\n for i in 0..sec.len() {\n t[i + tlen] = sec[i]\n }\n tlen += sec.len();\n for i in 0..y.len() {\n t[i + tlen] = y[i]\n }\n tlen += y.len();\n for i in 0..r.len() {\n t[i + tlen] = r[i]\n }\n tlen += r.len();\n for i in 0..w.len() {\n t[i + tlen] = w[i]\n }\n tlen += w.len();\n if tlen != 10 * RM + 4 {\n return false;\n }\n\n return hashit(sha, 0, &t, h);\n}", "rust_context": "fn hashit(sha: usize, n: usize, id: &[u8], w: &mut [u8]) -> bool {\n let mut r: [u8; 64] = [0; 64];\n let mut didit = false;\n if sha == SHA256 {\n let mut h = HASH256::new();\n if n > 0 {\n h.process_num(n as i32)\n }\n h.process_array(id);\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n didit = true;\n }\n if sha == SHA384 {\n let mut h = HASH384::new();\n if n > 0 {\n h.process_num(n as i32)\n }\n h.process_array(id);\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n didit = true;\n }\n if sha == SHA512 {\n let mut h = HASH512::new();\n if n > 0 {\n h.process_num(n as i32)\n }\n h.process_array(id);\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n didit = true;\n }\n if !didit {\n return false;\n }\n\n let rm = big::MODBYTES as usize;\n\n if sha > rm {\n for i in 0..rm {\n w[i] = r[i]\n }\n } else {\n for i in 0..sha {\n w[i + rm - sha] = r[i]\n }\n for i in 0..(rm - sha) {\n w[i] = 0\n }\n }\n\n return true;\n}", "rust_imports": "use std::time::SystemTime;\nuse std::time::UNIX_EPOCH;\nuse super::big;\nuse super::big::Big;\nuse super::ecp;\nuse super::ecp::ECP;\nuse super::ecp8::ECP8;\nuse super::fp16::FP16;\nuse super::fp48::FP48;\nuse super::pair256;\nuse super::rom;\nuse crate::hash256::HASH256;\nuse crate::hash384::HASH384;\nuse crate::hash512::HASH512;\nuse crate::rand::RAND;\nuse super::*;\nuse crate::test_utils::*;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__mpin256__.rs__function__27.txt"}
|
| 10 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/hash.c", "c_func": "void HASH512_hash(hash512 *sh,char *hash)\n{\n /* pad message and finish - supply digest */\n unsign64 len0;\n unsign64 len1;\n len0=sh->length[0];\n len1=sh->length[1];\n HASH512_process(sh,PAD);\n while ((sh->length[0]%1024)!=896) HASH512_process(sh,ZERO);\n sh->w[14]=len1;\n sh->w[15]=len0;\n HASH512_transform(sh);\n for (int i=0; i<sh->hlen; i++)\n {\n /* convert to bytes */\n hash[i]=(char)((sh->h[i/8]>>(8*(7-i%8))) & 0xffL);\n }\n HASH512_init(sh);\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/hash512.rs", "rust_func": "pub fn hash(&mut self) -> [u8; 64] {\n /* pad message and finish - supply digest */\n let mut digest: [u8; 64] = [0; 64];\n let len0 = self.length[0];\n let len1 = self.length[1];\n self.process(0x80);\n while (self.length[0] % 1024) != 896 {\n self.process(0)\n }\n self.w[14] = len1;\n self.w[15] = len0;\n self.transform();\n for i in 0..64 {\n /* convert to bytes */\n digest[i] = ((self.h[i / 8] >> (8 * (7 - i % 8))) & 0xff) as u8;\n }\n self.init();\n return digest;\n }", "rust_context": "fn transform(&mut self) {\n /* basic transformation step */\n for j in 16..80 {\n self.w[j] = Self::theta1(self.w[j - 2])\n .wrapping_add(self.w[j - 7])\n .wrapping_add(Self::theta0(self.w[j - 15]))\n .wrapping_add(self.w[j - 16]);\n }\n let mut a = self.h[0];\n let mut b = self.h[1];\n let mut c = self.h[2];\n let mut d = self.h[3];\n let mut e = self.h[4];\n let mut f = self.h[5];\n let mut g = self.h[6];\n let mut hh = self.h[7];\n for j in 0..80 {\n /* 64 times - mush it up */\n let t1 = hh\n .wrapping_add(Self::sig1(e))\n .wrapping_add(Self::ch(e, f, g))\n .wrapping_add(HASH512_K[j])\n .wrapping_add(self.w[j]);\n let t2 = Self::sig0(a).wrapping_add(Self::maj(a, b, c));\n hh = g;\n g = f;\n f = e;\n e = d.wrapping_add(t1);\n d = c;\n c = b;\n b = a;\n a = t1.wrapping_add(t2);\n }\n self.h[0] = self.h[0].wrapping_add(a);\n self.h[1] = self.h[1].wrapping_add(b);\n self.h[2] = self.h[2].wrapping_add(c);\n self.h[3] = self.h[3].wrapping_add(d);\n self.h[4] = self.h[4].wrapping_add(e);\n self.h[5] = self.h[5].wrapping_add(f);\n self.h[6] = self.h[6].wrapping_add(g);\n self.h[7] = self.h[7].wrapping_add(hh);\n }\n\npub fn init(&mut self) {\n /* initialise */\n for i in 0..64 {\n self.w[i] = 0\n }\n self.length[0] = 0;\n self.length[1] = 0;\n self.h[0] = HASH512_H0;\n self.h[1] = HASH512_H1;\n self.h[2] = HASH512_H2;\n self.h[3] = HASH512_H3;\n self.h[4] = HASH512_H4;\n self.h[5] = HASH512_H5;\n self.h[6] = HASH512_H6;\n self.h[7] = HASH512_H7;\n }\n\npub fn process(&mut self, byt: u8) {\n /* process the next message byte */\n let cnt = ((self.length[0] / 64) % 16) as usize;\n self.w[cnt] <<= 8;\n self.w[cnt] |= (byt & 0xFF) as u64;\n self.length[0] += 8;\n if self.length[0] == 0 {\n self.length[1] += 1;\n self.length[0] = 0\n }\n if (self.length[0] % 1024) == 0 {\n self.transform()\n }\n }\n\npub struct HASH512 {\n length: [u64; 2],\n h: [u64; 8],\n w: [u64; 80],\n}", "rust_imports": "use super::*;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__hash512__.rs__function__15.txt"}
|
| 11 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/rand.c", "c_func": "void RAND_seed(csprng *rng,int rawlen,const char *raw)\n{\n /* initialise from at least 128 byte string of raw *\n * random (keyboard?) input, and 32-bit time-of-day */\n int i;\n char digest[32];\n uchar b[4];\n hash256 sh;\n rng->pool_ptr=0;\n for (i=0; i<NK; i++) rng->ira[i]=0;\n if (rawlen>0)\n {\n HASH256_init(&sh);\n for (i=0; i<rawlen; i++)\n HASH256_process(&sh,raw[i]);\n HASH256_hash(&sh,digest);\n\n /* initialise PRNG from distilled randomness */\n\n for (i=0; i<8; i++)\n {\n b[0]=digest[4*i];\n b[1]=digest[4*i+1];\n b[2]=digest[4*i+2];\n b[3]=digest[4*i+3];\n sirand(rng,pack(b));\n }\n }\n fill_pool(rng);\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/rand.rs", "rust_func": "pub fn seed(&mut self, rawlen: usize, raw: &[u8]) {\n /* initialise from at least 128 byte string of raw random entropy */\n let mut b: [u8; 4] = [0; 4];\n let mut sh = HASH256::new();\n self.pool_ptr = 0;\n\n for i in 0..RAND_NK {\n self.ira[i] = 0\n }\n if rawlen > 0 {\n for i in 0..rawlen {\n sh.process(raw[i]);\n }\n let digest = sh.hash();\n\n /* initialise PRNG from distilled randomness */\n\n for i in 0..8 {\n b[0] = digest[4 * i];\n b[1] = digest[4 * i + 1];\n b[2] = digest[4 * i + 2];\n b[3] = digest[4 * i + 3];\n self.sirand(RAND::pack(b));\n }\n }\n self.fill_pool();\n }", "rust_context": "fn sirand(&mut self, seed: u32) {\n let mut m: u32 = 1;\n let mut sd = seed;\n self.borrow = 0;\n self.rndptr = 0;\n self.ira[0] ^= sd;\n for i in 1..RAND_NK {\n /* fill initialisation vector */\n let inn = (RAND_NV * i) % RAND_NK;\n self.ira[inn] ^= m; /* note XOR */\n let t = m;\n m = sd.wrapping_sub(m);\n sd = t;\n }\n for _ in 0..10000 {\n self.sbrand();\n } /* \"warm-up\" & stir the generator */\n }\n\npub fn process(&mut self, byt: u8) {\n /* process the next message byte */\n let cnt = ((self.length[0] / 32) % 16) as usize;\n self.w[cnt] <<= 8;\n self.w[cnt] |= (byt & 0xFF) as u32;\n self.length[0] += 8;\n if self.length[0] == 0 {\n self.length[1] += 1;\n self.length[0] = 0\n }\n if (self.length[0] % 512) == 0 {\n self.transform()\n }\n }\n\nfn fill_pool(&mut self) {\n let mut sh = HASH256::new();\n for _ in 0..128 {\n sh.process((self.sbrand() & 0xff) as u8)\n }\n let w = sh.hash();\n for i in 0..32 {\n self.pool[i] = w[i]\n }\n self.pool_ptr = 0;\n }\n\nfn pack(b: [u8; 4]) -> u32 {\n /* pack 4 bytes into a 32-bit Word */\n return (((b[3] as u32) & 0xff) << 24)\n | (((b[2] as u32) & 0xff) << 16)\n | (((b[1] as u32) & 0xff) << 8)\n | ((b[0] as u32) & 0xff);\n }\n \npub fn hash(&mut self) -> [u8; HASH_BYTES] {\n // pad message and finish - supply digest\n let mut digest: [u8; 32] = [0; 32];\n let len0 = self.length[0];\n let len1 = self.length[1];\n self.process(0x80);\n while (self.length[0] % 512) != 448 {\n self.process(0)\n }\n self.w[14] = len1;\n self.w[15] = len0;\n self.transform();\n for i in 0..32 {\n // convert to bytes\n digest[i] = ((self.h[i / 4] >> (8 * (3 - i % 4))) & 0xff) as u8;\n }\n self.init();\n return digest;\n }\n\npub fn new() -> HASH256 {\n let mut nh = HASH256 {\n length: [0; 2],\n h: [0; 8],\n w: [0; 64],\n };\n nh.init();\n return nh;\n }\n\npub struct RAND {\n ira: [u32; RAND_NK], /* random number... */\n rndptr: usize,\n borrow: u32,\n pool_ptr: usize,\n pool: [u8; 32],\n}", "rust_imports": "use crate::hash256::HASH256;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__rand__.rs__function__7.txt"}
|
| 12 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/rsa_support.c", "c_func": "int OAEP_DECODE(int sha,const octet *p,octet *f)\n{\n int comp;\n int x;\n int t;\n int i;\n int k;\n int olen=f->max-1;\n int hlen;\n int seedlen;\n char dbmask[MAX_RSA_BYTES];\n char seed[64];\n char chash[64];\n octet DBMASK= {0,sizeof(dbmask),dbmask};\n octet SEED= {0,sizeof(seed),seed};\n octet CHASH= {0,sizeof(chash),chash};\n\n seedlen=hlen=sha;\n if (olen<seedlen+hlen+1) return 1;\n if (!OCT_pad(f,olen+1)) return 1;\n hashit(sha,p,-1,&CHASH);\n\n x=f->val[0];\n for (i=seedlen; i<olen; i++)\n DBMASK.val[i-seedlen]=f->val[i+1];\n DBMASK.len=olen-seedlen;\n\n MGF1(sha,&DBMASK,seedlen,&SEED);\n for (i=0; i<seedlen; i++) SEED.val[i]^=f->val[i+1];\n MGF1(sha,&SEED,olen-seedlen,f);\n OCT_xor(&DBMASK,f);\n\n comp=OCT_ncomp(&CHASH,&DBMASK,hlen);\n\n OCT_shl(&DBMASK,hlen);\n\n OCT_clear(&SEED);\n OCT_clear(&CHASH);\n\n for (k=0;; k++)\n {\n if (k>=DBMASK.len)\n {\n OCT_clear(&DBMASK);\n return 1;\n }\n if (DBMASK.val[k]!=0) break;\n }\n\n t=DBMASK.val[k];\n if (!comp || x!=0 || t!=0x01)\n {\n OCT_clear(&DBMASK);\n return 1;\n }\n\n OCT_shl(&DBMASK,k+1);\n OCT_copy(f,&DBMASK);\n OCT_clear(&DBMASK);\n\n return 0;\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/rsa.rs", "rust_func": "pub fn oaep_decode(sha: usize, p: Option<&[u8]>, f: &mut [u8]) -> usize {\n let olen = RFS - 1;\n\n let hlen = sha;\n let mut seed: [u8; 64] = [0; 64];\n let seedlen = hlen;\n let mut chash: [u8; 64] = [0; 64];\n\n if olen < seedlen + hlen + 1 {\n return 0;\n }\n let mut dbmask: [u8; RFS] = [0; RFS];\n //for i in 0..olen-seedlen {dbmask[i]=0}\n\n if f.len() < RFS {\n let d = RFS - f.len();\n for i in (d..RFS).rev() {\n f[i] = f[i - d];\n }\n for i in (0..d).rev() {\n f[i] = 0;\n }\n }\n\n hashit(sha, p, -1, &mut chash);\n\n let x = f[0];\n\n for i in seedlen..olen {\n dbmask[i - seedlen] = f[i + 1];\n }\n\n mgf1(sha, &dbmask[0..olen - seedlen], seedlen, &mut seed);\n for i in 0..seedlen {\n seed[i] ^= f[i + 1]\n }\n mgf1(sha, &seed, olen - seedlen, f);\n for i in 0..olen - seedlen {\n dbmask[i] ^= f[i]\n }\n\n let mut comp = true;\n for i in 0..hlen {\n if chash[i] != dbmask[i] {\n comp = false\n }\n }\n\n for i in 0..olen - seedlen - hlen {\n dbmask[i] = dbmask[i + hlen]\n }\n\n for i in 0..hlen {\n seed[i] = 0;\n chash[i] = 0\n }\n\n let mut k = 0;\n loop {\n if k >= olen - seedlen - hlen {\n return 0;\n }\n if dbmask[k] != 0 {\n break;\n }\n k += 1;\n }\n\n let t = dbmask[k];\n if !comp || x != 0 || t != 0x01 {\n for i in 0..olen - seedlen {\n dbmask[i] = 0\n }\n return 0;\n }\n\n for i in 0..olen - seedlen - hlen - k - 1 {\n f[i] = dbmask[i + k + 1];\n }\n\n for i in 0..olen - seedlen {\n dbmask[i] = 0\n }\n\n return olen - seedlen - hlen - k - 1;\n}", "rust_context": "fn hashit(sha: usize, a: Option<&[u8]>, n: isize, w: &mut [u8]) {\n if sha == SHA256 {\n let mut h = HASH256::new();\n if let Some(x) = a {\n h.process_array(x);\n }\n if n >= 0 {\n h.process_num(n as i32)\n }\n let hs = h.hash();\n for i in 0..sha {\n w[i] = hs[i]\n }\n }\n if sha == SHA384 {\n let mut h = HASH384::new();\n if let Some(x) = a {\n h.process_array(x);\n }\n if n >= 0 {\n h.process_num(n as i32)\n }\n let hs = h.hash();\n for i in 0..sha {\n w[i] = hs[i]\n }\n }\n if sha == SHA512 {\n let mut h = HASH512::new();\n if let Some(x) = a {\n h.process_array(x);\n }\n if n >= 0 {\n h.process_num(n as i32)\n }\n let hs = h.hash();\n for i in 0..sha {\n w[i] = hs[i]\n }\n }\n}\n\npub fn mgf1(sha: usize, z: &[u8], olen: usize, k: &mut [u8]) {\n let hlen = sha;\n\n let mut j = 0;\n for i in 0..k.len() {\n k[i] = 0\n }\n\n let mut cthreshold = olen / hlen;\n if olen % hlen != 0 {\n cthreshold += 1\n }\n for counter in 0..cthreshold {\n let mut b: [u8; 64] = [0; 64];\n hashit(sha, Some(z), counter as isize, &mut b);\n\n if j + hlen > olen {\n for i in 0..(olen % hlen) {\n k[j] = b[i];\n j += 1\n }\n } else {\n for i in 0..hlen {\n k[j] = b[i];\n j += 1\n }\n }\n }\n}\n\npub const RFS: usize = (big::MODBYTES as usize) * ff::FFLEN;", "rust_imports": "use super::big;\nuse super::ff;\nuse super::ff::FF;\nuse crate::hash256::HASH256;\nuse crate::hash384::HASH384;\nuse crate::hash512::HASH512;\nuse crate::rand::RAND;\nuse super::*;\nuse crate::test_utils::*;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__rsa__.rs__function__8.txt"}
|
| 13 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/pbc_support.c", "c_func": "void HASH_ID(int sha,const octet *ID,octet *HID)\n{\n mhashit(sha,0,ID,HID);\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/mpin.rs", "rust_func": "pub fn hash_id(sha: usize, id: &[u8], w: &mut [u8]) -> bool {\n return hashit(sha, 0, id, w);\n}", "rust_context": "fn hashit(sha: usize, n: usize, id: &[u8], w: &mut [u8]) -> bool {\n let mut r: [u8; 64] = [0; 64];\n let mut didit = false;\n if sha == SHA256 {\n let mut h = HASH256::new();\n if n > 0 {\n h.process_num(n as i32)\n }\n h.process_array(id);\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n didit = true;\n }\n if sha == SHA384 {\n let mut h = HASH384::new();\n if n > 0 {\n h.process_num(n as i32)\n }\n h.process_array(id);\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n didit = true;\n }\n if sha == SHA512 {\n let mut h = HASH512::new();\n if n > 0 {\n h.process_num(n as i32)\n }\n h.process_array(id);\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n didit = true;\n }\n if !didit {\n return false;\n }\n\n let rm = big::MODBYTES as usize;\n\n if sha > rm {\n for i in 0..rm {\n w[i] = r[i]\n }\n } else {\n for i in 0..sha {\n w[i + rm - sha] = r[i]\n }\n for i in 0..(rm - sha) {\n w[i] = 0\n }\n }\n\n return true;\n}", "rust_imports": "use std::time::SystemTime;\nuse std::time::UNIX_EPOCH;\nuse super::big;\nuse super::big::Big;\nuse super::ecp;\nuse super::ecp::ECP;\nuse super::ecp2::ECP2;\nuse super::fp12::FP12;\nuse super::fp4::FP4;\nuse super::pair;\nuse super::rom;\nuse crate::hash256::HASH256;\nuse crate::hash384::HASH384;\nuse crate::hash512::HASH512;\nuse crate::rand::RAND;\nuse super::*;\nuse crate::test_utils::*;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__mpin__.rs__function__6.txt"}
|
| 14 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/pbc_support.c", "c_func": "void HASH_ID(int sha,const octet *ID,octet *HID)\n{\n mhashit(sha,0,ID,HID);\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/mpin256.rs", "rust_func": "pub fn hash_id(sha: usize, id: &[u8], w: &mut [u8]) -> bool {\n return hashit(sha, 0, id, w);\n}", "rust_context": "fn hashit(sha: usize, n: usize, id: &[u8], w: &mut [u8]) -> bool {\n let mut r: [u8; 64] = [0; 64];\n let mut didit = false;\n if sha == SHA256 {\n let mut h = HASH256::new();\n if n > 0 {\n h.process_num(n as i32)\n }\n h.process_array(id);\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n didit = true;\n }\n if sha == SHA384 {\n let mut h = HASH384::new();\n if n > 0 {\n h.process_num(n as i32)\n }\n h.process_array(id);\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n didit = true;\n }\n if sha == SHA512 {\n let mut h = HASH512::new();\n if n > 0 {\n h.process_num(n as i32)\n }\n h.process_array(id);\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n didit = true;\n }\n if !didit {\n return false;\n }\n\n let rm = big::MODBYTES as usize;\n\n if sha > rm {\n for i in 0..rm {\n w[i] = r[i]\n }\n } else {\n for i in 0..sha {\n w[i + rm - sha] = r[i]\n }\n for i in 0..(rm - sha) {\n w[i] = 0\n }\n }\n\n return true;\n}", "rust_imports": "use std::time::SystemTime;\nuse std::time::UNIX_EPOCH;\nuse super::big;\nuse super::big::Big;\nuse super::ecp;\nuse super::ecp::ECP;\nuse super::ecp8::ECP8;\nuse super::fp16::FP16;\nuse super::fp48::FP48;\nuse super::pair256;\nuse super::rom;\nuse crate::hash256::HASH256;\nuse crate::hash384::HASH384;\nuse crate::hash512::HASH512;\nuse crate::rand::RAND;\nuse super::*;\nuse crate::test_utils::*;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__mpin256__.rs__function__6.txt"}
|
| 15 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/rsa_support.c", "c_func": "int PKCS15(int sha,const octet *m,octet *w)\n{\n int olen=w->max;\n int hlen=sha;\n int idlen=19;\n char h[64];\n octet H= {0,sizeof(h),h};\n\n if (olen<idlen+hlen+10) return 1;\n hashit(sha,m,-1,&H);\n\n OCT_empty(w);\n OCT_jbyte(w,0x00,1);\n OCT_jbyte(w,0x01,1);\n OCT_jbyte(w,0xff,olen-idlen-hlen-3);\n OCT_jbyte(w,0x00,1);\n\n if (hlen==32) OCT_jbytes(w,(char *)SHA256ID,idlen);\n if (hlen==48) OCT_jbytes(w,(char *)SHA384ID,idlen);\n if (hlen==64) OCT_jbytes(w,(char *)SHA512ID,idlen);\n\n OCT_joctet(w,&H);\n\n return 0;\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/rsa.rs", "rust_func": "pub fn pkcs15(sha: usize, m: &[u8], w: &mut [u8]) -> bool {\n let olen = ff::FF_BITS / 8;\n let hlen = sha;\n let idlen = 19;\n let mut b: [u8; 64] = [0; 64]; /* Not good */\n\n if olen < idlen + hlen + 10 {\n return false;\n }\n hashit(sha, Some(m), -1, &mut b);\n\n for i in 0..w.len() {\n w[i] = 0\n }\n let mut i = 0;\n w[i] = 0;\n i += 1;\n w[i] = 1;\n i += 1;\n for _ in 0..olen - idlen - hlen - 3 {\n w[i] = 0xff;\n i += 1\n }\n w[i] = 0;\n i += 1;\n\n if hlen == SHA256 {\n for j in 0..idlen {\n w[i] = SHA256ID[j];\n i += 1\n }\n }\n if hlen == SHA384 {\n for j in 0..idlen {\n w[i] = SHA384ID[j];\n i += 1\n }\n }\n if hlen == SHA512 {\n for j in 0..idlen {\n w[i] = SHA512ID[j];\n i += 1\n }\n }\n for j in 0..hlen {\n w[i] = b[j];\n i += 1\n }\n\n return true;\n}", "rust_context": "fn hashit(sha: usize, a: Option<&[u8]>, n: isize, w: &mut [u8]) {\n if sha == SHA256 {\n let mut h = HASH256::new();\n if let Some(x) = a {\n h.process_array(x);\n }\n if n >= 0 {\n h.process_num(n as i32)\n }\n let hs = h.hash();\n for i in 0..sha {\n w[i] = hs[i]\n }\n }\n if sha == SHA384 {\n let mut h = HASH384::new();\n if let Some(x) = a {\n h.process_array(x);\n }\n if n >= 0 {\n h.process_num(n as i32)\n }\n let hs = h.hash();\n for i in 0..sha {\n w[i] = hs[i]\n }\n }\n if sha == SHA512 {\n let mut h = HASH512::new();\n if let Some(x) = a {\n h.process_array(x);\n }\n if n >= 0 {\n h.process_num(n as i32)\n }\n let hs = h.hash();\n for i in 0..sha {\n w[i] = hs[i]\n }\n }\n}\n\nconst SHA256ID: [u8; 19] = [\n 0x30, 0x31, 0x30, 0x0d, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x01, 0x05,\n 0x00, 0x04, 0x20,\n];\nconst SHA384ID: [u8; 19] = [\n 0x30, 0x41, 0x30, 0x0d, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x02, 0x05,\n 0x00, 0x04, 0x30,\n];\nconst SHA512ID: [u8; 19] = [\n 0x30, 0x51, 0x30, 0x0d, 0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x03, 0x05,\n 0x00, 0x04, 0x40,\n];", "rust_imports": "use super::big;\nuse super::ff;\nuse super::ff::FF;\nuse crate::hash256::HASH256;\nuse crate::hash384::HASH384;\nuse crate::hash512::HASH512;\nuse crate::rand::RAND;\nuse super::*;\nuse crate::test_utils::*;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__rsa__.rs__function__6.txt"}
|
| 16 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/hash.c", "c_func": "void HASH384_hash(hash384 *sh,char *hash)\n{\n /* pad message and finish - supply digest */\n unsign64 len0;\n unsign64 len1;\n len0=sh->length[0];\n len1=sh->length[1];\n HASH384_process(sh,PAD);\n while ((sh->length[0]%1024)!=896) HASH384_process(sh,ZERO);\n sh->w[14]=len1;\n sh->w[15]=len0;\n HASH384_transform(sh);\n for (int i=0; i<sh->hlen; i++)\n {\n /* convert to bytes */\n hash[i]=(char)((sh->h[i/8]>>(8*(7-i%8))) & 0xffL);\n }\n HASH384_init(sh);\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/hash384.rs", "rust_func": "pub fn hash(&mut self) -> [u8; HASH_BYTES] {\n /* pad message and finish - supply digest */\n let mut digest: [u8; 48] = [0; HASH_BYTES];\n let len0 = self.length[0];\n let len1 = self.length[1];\n self.process(0x80);\n while (self.length[0] % 1024) != 896 {\n self.process(0)\n }\n self.w[14] = len1;\n self.w[15] = len0;\n self.transform();\n for i in 0..HASH_BYTES {\n // convert to bytes\n digest[i] = ((self.h[i / 8] >> (8 * (7 - i % 8))) & 0xff) as u8;\n }\n self.init();\n return digest;\n }", "rust_context": "fn transform(&mut self) {\n // basic transformation step\n for j in 16..80 {\n self.w[j] = Self::theta1(self.w[j - 2])\n .wrapping_add(self.w[j - 7])\n .wrapping_add(Self::theta0(self.w[j - 15]))\n .wrapping_add(self.w[j - 16]);\n }\n let mut a = self.h[0];\n let mut b = self.h[1];\n let mut c = self.h[2];\n let mut d = self.h[3];\n let mut e = self.h[4];\n let mut f = self.h[5];\n let mut g = self.h[6];\n let mut hh = self.h[7];\n for j in 0..80 {\n /* 64 times - mush it up */\n let t1 = hh\n .wrapping_add(Self::sig1(e))\n .wrapping_add(Self::ch(e, f, g))\n .wrapping_add(HASH384_K[j])\n .wrapping_add(self.w[j]);\n let t2 = Self::sig0(a).wrapping_add(Self::maj(a, b, c));\n hh = g;\n g = f;\n f = e;\n e = d.wrapping_add(t1);\n d = c;\n c = b;\n b = a;\n a = t1.wrapping_add(t2);\n }\n self.h[0] = self.h[0].wrapping_add(a);\n self.h[1] = self.h[1].wrapping_add(b);\n self.h[2] = self.h[2].wrapping_add(c);\n self.h[3] = self.h[3].wrapping_add(d);\n self.h[4] = self.h[4].wrapping_add(e);\n self.h[5] = self.h[5].wrapping_add(f);\n self.h[6] = self.h[6].wrapping_add(g);\n self.h[7] = self.h[7].wrapping_add(hh);\n }\n\npub fn init(&mut self) {\n // initialise\n for i in 0..64 {\n self.w[i] = 0\n }\n self.length[0] = 0;\n self.length[1] = 0;\n self.h[0] = HASH384_H0;\n self.h[1] = HASH384_H1;\n self.h[2] = HASH384_H2;\n self.h[3] = HASH384_H3;\n self.h[4] = HASH384_H4;\n self.h[5] = HASH384_H5;\n self.h[6] = HASH384_H6;\n self.h[7] = HASH384_H7;\n }\n\npub fn process(&mut self, byt: u8) {\n /* process the next message byte */\n let cnt = ((self.length[0] / 64) % 16) as usize;\n self.w[cnt] <<= 8;\n self.w[cnt] |= (byt & 0xFF) as u64;\n self.length[0] += 8;\n if self.length[0] == 0 {\n self.length[1] += 1;\n self.length[0] = 0\n }\n if (self.length[0] % 1024) == 0 {\n self.transform()\n }\n }\n\npub struct HASH384 {\n length: [u64; 2],\n h: [u64; 8],\n w: [u64; 80],\n}\n\npub const HASH_BYTES: usize = 48;", "rust_imports": "use super::*;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__hash384__.rs__function__15.txt"}
|
| 17 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/hash.c", "c_func": "void HASH512_init(hash512 *sh)\n{\n /* re-initialise */\n for (int i=0; i<80; i++) sh->w[i]=0;\n sh->length[0]=sh->length[1]=0;\n sh->h[0]=H0_512;\n sh->h[1]=H1_512;\n sh->h[2]=H2_512;\n sh->h[3]=H3_512;\n sh->h[4]=H4_512;\n sh->h[5]=H5_512;\n sh->h[6]=H6_512;\n sh->h[7]=H7_512;\n\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/hash512.rs", "rust_func": "pub fn init(&mut self) {\n /* initialise */\n for i in 0..64 {\n self.w[i] = 0\n }\n self.length[0] = 0;\n self.length[1] = 0;\n self.h[0] = HASH512_H0;\n self.h[1] = HASH512_H1;\n self.h[2] = HASH512_H2;\n self.h[3] = HASH512_H3;\n self.h[4] = HASH512_H4;\n self.h[5] = HASH512_H5;\n self.h[6] = HASH512_H6;\n self.h[7] = HASH512_H7;\n }", "rust_context": "pub struct HASH512 {\n length: [u64; 2],\n h: [u64; 8],\n w: [u64; 80],\n}\n\nconst HASH512_H0: u64 = 0x6a09e667f3bcc908;\nconst HASH512_H1: u64 = 0xbb67ae8584caa73b;\nconst HASH512_H2: u64 = 0x3c6ef372fe94f82b;\nconst HASH512_H3: u64 = 0xa54ff53a5f1d36f1;\nconst HASH512_H4: u64 = 0x510e527fade682d1;\nconst HASH512_H5: u64 = 0x9b05688c2b3e6c1f;\nconst HASH512_H6: u64 = 0x1f83d9abfb41bd6b;\nconst HASH512_H7: u64 = 0x5be0cd19137e2179;", "rust_imports": "use super::*;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__hash512__.rs__function__10.txt"}
|
| 18 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/hash.c", "c_func": "void HASH384_init(hash384 *sh)\n{\n /* re-initialise */\n for (int i=0; i<80; i++) sh->w[i]=0;\n sh->length[0]=sh->length[1]=0;\n sh->h[0]=H8_512;\n sh->h[1]=H9_512;\n sh->h[2]=HA_512;\n sh->h[3]=HB_512;\n sh->h[4]=HC_512;\n sh->h[5]=HD_512;\n sh->h[6]=HE_512;\n sh->h[7]=HF_512;\n\n\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/hash384.rs", "rust_func": "pub fn init(&mut self) {\n // initialise\n for i in 0..64 {\n self.w[i] = 0\n }\n self.length[0] = 0;\n self.length[1] = 0;\n self.h[0] = HASH384_H0;\n self.h[1] = HASH384_H1;\n self.h[2] = HASH384_H2;\n self.h[3] = HASH384_H3;\n self.h[4] = HASH384_H4;\n self.h[5] = HASH384_H5;\n self.h[6] = HASH384_H6;\n self.h[7] = HASH384_H7;\n }", "rust_context": "pub struct HASH384 {\n length: [u64; 2],\n h: [u64; 8],\n w: [u64; 80],\n}\n\nconst HASH384_H0: u64 = 0xcbbb9d5dc1059ed8;\nconst HASH384_H1: u64 = 0x629a292a367cd507;\nconst HASH384_H2: u64 = 0x9159015a3070dd17;\nconst HASH384_H3: u64 = 0x152fecd8f70e5939;\nconst HASH384_H4: u64 = 0x67332667ffc00b31;\nconst HASH384_H5: u64 = 0x8eb44a8768581511;\nconst HASH384_H6: u64 = 0xdb0c2e0d64f98fa7;\nconst HASH384_H7: u64 = 0x47b5481dbefa4fa4;", "rust_imports": "use super::*;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__hash384__.rs__function__10.txt"}
|
| 19 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/rand.c", "c_func": "void RAND_clean(csprng *rng)\n{\n /* kill internal state */\n int i;\n rng->pool_ptr=rng->rndptr=0;\n for (i=0; i<32; i++) rng->pool[i]=0;\n for (i=0; i<NK; i++) rng->ira[i]=0;\n rng->borrow=0;\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/rand.rs", "rust_func": "pub fn clean(&mut self) {\n self.pool_ptr = 0;\n self.rndptr = 0;\n for i in 0..32 {\n self.pool[i] = 0\n }\n for i in 0..RAND_NK {\n self.ira[i] = 0\n }\n self.borrow = 0;\n }", "rust_context": "pub struct RAND {\n ira: [u32; RAND_NK], /* random number... */\n rndptr: usize,\n borrow: u32,\n pool_ptr: usize,\n pool: [u8; 32],\n}\n\nconst RAND_NK: usize = 21;", "rust_imports": "use crate::hash256::HASH256;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__rand__.rs__function__2.txt"}
|
| 20 |
+
{"c_path": "projects/incubator-milagro-crypto/c/src/pbc_support.c", "c_func": "void HASH_ID(int sha,const octet *ID,octet *HID)\n{\n mhashit(sha,0,ID,HID);\n}", "rust_path": "projects/incubator-milagro-crypto/rust/src/mpin192.rs", "rust_func": "pub fn hash_id(sha: usize, id: &[u8], w: &mut [u8]) -> bool {\n return hashit(sha, 0, id, w);\n}", "rust_context": "fn hashit(sha: usize, n: usize, id: &[u8], w: &mut [u8]) -> bool {\n let mut r: [u8; 64] = [0; 64];\n let mut didit = false;\n if sha == SHA256 {\n let mut h = HASH256::new();\n if n > 0 {\n h.process_num(n as i32)\n }\n h.process_array(id);\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n didit = true;\n }\n if sha == SHA384 {\n let mut h = HASH384::new();\n if n > 0 {\n h.process_num(n as i32)\n }\n h.process_array(id);\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n didit = true;\n }\n if sha == SHA512 {\n let mut h = HASH512::new();\n if n > 0 {\n h.process_num(n as i32)\n }\n h.process_array(id);\n let hs = h.hash();\n for i in 0..sha {\n r[i] = hs[i];\n }\n didit = true;\n }\n if !didit {\n return false;\n }\n\n let rm = big::MODBYTES as usize;\n\n if sha > rm {\n for i in 0..rm {\n w[i] = r[i]\n }\n } else {\n for i in 0..sha {\n w[i + rm - sha] = r[i]\n }\n for i in 0..(rm - sha) {\n w[i] = 0\n }\n }\n\n return true;\n}", "rust_imports": "use std::time::SystemTime;\nuse std::time::UNIX_EPOCH;\nuse super::big;\nuse super::big::Big;\nuse super::ecp;\nuse super::ecp::ECP;\nuse super::ecp4::ECP4;\nuse super::fp24::FP24;\nuse super::fp8::FP8;\nuse super::pair192;\nuse super::rom;\nuse crate::hash256::HASH256;\nuse crate::hash384::HASH384;\nuse crate::hash512::HASH512;\nuse crate::rand::RAND;\nuse super::*;\nuse crate::test_utils::*;", "rustrepotrans_file": "projects__incubator-milagro-crypto__rust__src__mpin192__.rs__function__6.txt"}
|