Cryptography Did I find a solution to prime factorization? |
Did I find a solution to prime factorization? Posted: 03 Jun 2018 07:33 PM PDT |
Posted: 03 Jun 2018 08:02 AM PDT Been trying to implement HMAC for fun in code. I've been following the formula H( k xor opad, H(k xor ipad || m)) where key is 64 random bytes, opad=0x5c * 64 and ipad=0x36 * 64 (I'm using SHA1 so the block size is 64). However I keep getting the wrong result and I'm guessing it has something to do with the way I am xor'ing. I set the loop as for (int i=0; i<key.length; i++){ } Is there anything I'm doing wrong? Thank you [link] [comments] |
You are subscribed to email updates from Cryptography news and discussions. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States |
No comments:
Post a Comment