hmac-0.7.1/Cargo.toml.orig010064400017500001750000000012241351166221000135330ustar0000000000000000[package] name = "hmac" version = "0.7.1" authors = ["RustCrypto Developers"] license = "MIT OR Apache-2.0" description = "Generic implementation of Hash-based Message Authentication Code (HMAC)" documentation = "https://docs.rs/hmac" repository = "https://github.com/RustCrypto/MACs" keywords = ["crypto", "mac", "hmac", "digest"] categories = ["cryptography", "no-std"] [dependencies] crypto-mac = "0.7" digest = "0.8" [dev-dependencies] crypto-mac = { version = "0.7", features = ["dev"] } md-5 = { version = "0.8", default-features = false } sha2 = { version = "0.8", default-features = false } [badges] travis-ci = { repository = "RustCrypto/hashes" } hmac-0.7.1/Cargo.toml0000644000000023130000000000000100050ustar00# THIS FILE IS AUTOMATICALLY GENERATED BY CARGO # # When uploading crates to the registry Cargo will automatically # "normalize" Cargo.toml files for maximal compatibility # with all versions of Cargo and also rewrite `path` dependencies # to registry (e.g., crates.io) dependencies # # If you believe there's an error in this file please file an # issue against the rust-lang/cargo repository. If you're # editing this file be aware that the upstream Cargo.toml # will likely look very different (and much more reasonable) [package] name = "hmac" version = "0.7.1" authors = ["RustCrypto Developers"] description = "Generic implementation of Hash-based Message Authentication Code (HMAC)" documentation = "https://docs.rs/hmac" keywords = ["crypto", "mac", "hmac", "digest"] categories = ["cryptography", "no-std"] license = "MIT OR Apache-2.0" repository = "https://github.com/RustCrypto/MACs" [dependencies.crypto-mac] version = "0.7" [dependencies.digest] version = "0.8" [dev-dependencies.crypto-mac] version = "0.7" features = ["dev"] [dev-dependencies.md-5] version = "0.8" default-features = false [dev-dependencies.sha2] version = "0.8" default-features = false [badges.travis-ci] repository = "RustCrypto/hashes" hmac-0.7.1/LICENSE-APACHE010064400017500001750000000251411313533417700126060ustar0000000000000000 Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. hmac-0.7.1/LICENSE-MIT010064400017500001750000000020411313533417700123100ustar0000000000000000Copyright (c) 2017 Artyom Pavlov Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. hmac-0.7.1/src/lib.rs010064400017500001750000000135321351166221000125540ustar0000000000000000//! Generic implementation of Hash-based Message Authentication Code (HMAC). //! //! To use it you'll need a cryptographic hash function implementation from //! RustCrypto project. You can either import specific crate (e.g. `sha2`), or //! meta-crate `crypto-hashes` which reexport all related crates. //! //! # Usage //! Let us demonstrate how to use HMAC using SHA256 as an example. //! //! To get the authentication code: //! //! ```rust //! extern crate hmac; //! extern crate sha2; //! //! use sha2::Sha256; //! use hmac::{Hmac, Mac}; //! //! // Create alias for HMAC-SHA256 //! type HmacSha256 = Hmac; //! //! # fn main() { //! // Create HMAC-SHA256 instance which implements `Mac` trait //! let mut mac = HmacSha256::new_varkey(b"my secret and secure key") //! .expect("HMAC can take key of any size"); //! mac.input(b"input message"); //! //! // `result` has type `MacResult` which is a thin wrapper around array of //! // bytes for providing constant time equality check //! let result = mac.result(); //! // To get underlying array use `code` method, but be carefull, since //! // incorrect use of the code value may permit timing attacks which defeat //! // the security provided by the `MacResult` //! let code_bytes = result.code(); //! # } //! ``` //! //! To verify the message: //! //! ```rust //! # extern crate hmac; //! # extern crate sha2; //! # use sha2::Sha256; //! # use hmac::{Hmac, Mac}; //! # fn main() { //! # type HmacSha256 = Hmac; //! let mut mac = HmacSha256::new_varkey(b"my secret and secure key") //! .expect("HMAC can take key of any size"); //! //! mac.input(b"input message"); //! //! # let code_bytes = mac.clone().result().code(); //! // `verify` will return `Ok(())` if code is correct, `Err(MacError)` otherwise //! mac.verify(&code_bytes).unwrap(); //! # } //! ``` //! //! # Block and input sizes //! Usually it is assumed that block size is larger than output size, due to the //! generic nature of the implementation this edge case must be handled as well //! to remove potential panic scenario. This is done by truncating hash output //! to the hash block size if needed. #![no_std] #![doc(html_logo_url = "https://raw.githubusercontent.com/RustCrypto/meta/master/logo_small.png")] pub extern crate digest; pub extern crate crypto_mac; pub use crypto_mac::Mac; use crypto_mac::{InvalidKeyLength, MacResult}; use digest::{Input, BlockInput, FixedOutput, Reset}; use digest::generic_array::{ArrayLength, GenericArray}; use digest::generic_array::sequence::GenericSequence; use core::cmp::min; use core::fmt; const IPAD: u8 = 0x36; const OPAD: u8 = 0x5C; /// The `Hmac` struct represents an HMAC using a given hash function `D`. pub struct Hmac where D: Input + BlockInput + FixedOutput + Reset + Default + Clone, D::BlockSize: ArrayLength { digest: D, i_key_pad: GenericArray, opad_digest: D, } impl Clone for Hmac where D: Input + BlockInput + FixedOutput + Reset + Default + Clone, D::BlockSize: ArrayLength { fn clone(&self) -> Hmac { Hmac { digest: self.digest.clone(), i_key_pad: self.i_key_pad.clone(), opad_digest: self.opad_digest.clone(), } } } impl fmt::Debug for Hmac where D: Input + BlockInput + FixedOutput + Reset + Default + Clone + fmt::Debug, D::BlockSize: ArrayLength { fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result { f.debug_struct("Hmac") .field("digest", &self.digest) .field("i_key_pad", &self.i_key_pad) .field("opad_digest", &self.opad_digest) .finish() } } impl Mac for Hmac where D: Input + BlockInput + FixedOutput + Reset + Default + Clone, D::BlockSize: ArrayLength, D::OutputSize: ArrayLength { type OutputSize = D::OutputSize; type KeySize = D::BlockSize; fn new(key: &GenericArray) -> Self { Self::new_varkey(key.as_slice()).unwrap() } #[inline] fn new_varkey(key: &[u8]) -> Result { let mut hmac = Self { digest: Default::default(), i_key_pad: GenericArray::generate(|_| IPAD), opad_digest: Default::default(), }; let mut opad = GenericArray::::generate(|_| OPAD); debug_assert!(hmac.i_key_pad.len() == opad.len()); // The key that Hmac processes must be the same as the block size of the // underlying Digest. If the provided key is smaller than that, we just // pad it with zeros. If its larger, we hash it and then pad it with // zeros. if key.len() <= hmac.i_key_pad.len() { for (k_idx, k_itm) in key.iter().enumerate() { hmac.i_key_pad[k_idx] ^= *k_itm; opad[k_idx] ^= *k_itm; } } else { let mut digest = D::default(); digest.input(key); let output = digest.fixed_result(); // `n` is calculated at compile time and will equal // D::OutputSize. This is used to ensure panic-free code let n = min(output.len(), hmac.i_key_pad.len()); for idx in 0..n { hmac.i_key_pad[idx] ^= output[idx]; opad[idx] ^= output[idx]; } } hmac.digest.input(&hmac.i_key_pad); hmac.opad_digest.input(&opad); Ok(hmac) } #[inline] fn input(&mut self, data: &[u8]) { self.digest.input(data); } #[inline] fn result(self) -> MacResult { let mut opad_digest = self.opad_digest.clone(); let hash = self.digest.fixed_result(); opad_digest.input(&hash); MacResult::new(opad_digest.fixed_result()) } #[inline] fn reset(&mut self) { self.digest.reset(); self.digest.input(&self.i_key_pad); } } hmac-0.7.1/tests/data/md5.blb010064400017500001750000000003731342156012200140700ustar0000000000000000blobby1 Hi Thererz68Jefewhat do ya want for nothing?u x>jn1 ]82V4RL۸3key+The quick brown fox jumps over the lazy dogF>wI -Iuhmac-0.7.1/tests/data/sha224.blb010064400017500001750000000016511342156012200144060ustar0000000000000000blobby1 Hi Thereoh2|ԝ?GOShK"Jefewhat do ya want for nothing? ۿEi:~maH^D25iM}jde]i3 2lPht6FMБ)Y >"cUe 2 U8D<́:xz.?g)f[ Test With Truncation tsn yl)UU+o| j` Ń6Test Using Larger Than Block-Size Key - Hash Key First `1Y & !7(FTThis is a test using a larger than block-size key and a larger than block-size data. The key needs to be hashed before being used by the HMAC algorithm. /'c_հDcdOQS\:5hmac-0.7.1/tests/data/sha384.blb010064400017500001750000000020651342156012200144150ustar0000000000000000blobby1 Hi There09DHbk%FƂL|ŜꞩnJRJefewhat do ya want for nothing?0EvH@1axҵk~dG.sc"D^"@^iNj29I20&歊 Ȩo 5G>YfK*Z8N:O' 20>ix<%3blzHPW|nW;Nh#ħyt Test With Truncation0:4P;*#na,L\ˮ@b&*7͈cAꃪ6Test Using Larger Than Block-Size Key - Hash Key First0ND>:ŴO*+X<: .@0$cIRThis is a test using a larger than block-size key and a larger than block-size data. The key needs to be hashed before being used by the HMAC algorithm.0f 5/%N,`$ λFŦx1m8` FR>hmac-0.7.1/tests/data/sha512.blb010064400017500001750000000022451342156012200144060ustar0000000000000000blobby1 Hi There@|ޥaO$l#yNxzгE|ڨ3ָ'N依Nap.il :hTJefewhat do ya want for nothing?@Kz{;Vࣇd".' %TXuZJmOe걣MJkKcn 872@sVul 鱵ݎ6U>3'9>y"~gF7&t'Y2 2@FV7EiJvK-oP6۩^y'\xcA O- Test With Truncation@A_bqX SAyP*O6f:mq[P#P3dEOg)gsfk6Test Using Larger Than Block-Size Key - Hash Key First@Bc{贛FJ7RkV7_%!]jROs? 싑Z]xeThis is a test using a larger than block-size key and a larger than block-size data. The key needs to be hashed before being used by the HMAC algorithm.@{jw]}ߩn^?޽qr]- D,); new_test!(hmac_sha224, "sha224", Hmac); new_test!(hmac_sha256, "sha256", Hmac); new_test!(hmac_sha384, "sha384", Hmac); new_test!(hmac_sha512, "sha512", Hmac); hmac-0.7.1/.cargo_vcs_info.json0000644000000001120000000000000120020ustar00{ "git": { "sha1": "2e73cdf49ec9706d25c36ba846fc866d59741c60" } }