|
| |
| | Message authentication code - Wikipedia, the free encyclopedia |
 | | A MAC algorithm accepts as input a secret key and an arbitrary-length message to be authenticated, and outputs a MAC (sometimes known as a tag). | | | MAC algorithms can be constructed from other cryptographic primitives, such as cryptographic hash functions (as in the case of HMAC) or from block cipher algorithms (OMAC, CBC-MAC and PMAC). | | | Data Authentication Code, a DES-based MAC algorithm from ANSI |
|
http://en.wikipedia.org/wiki/Message_authentication_code
(336 words)
|
|
| |
| | zorn-radius-keywrap-08.txt |
| | MAC Both the length and value of the MAC field depend upon the algorithm specified by the value of the MAC Type field. | | | The derivation of the MAC field value for all the algorithms specified in this document is identical, except for the algorithm used. | | | Response Messages For responses (e.g., CoA-ACK [RFC3576], Accounting-Response [RFC2866], etc.), the value of the MAC field is a hash of the entire packet except the Response Authenticator using a shared secret as the key, as follows. |
|
http://ietfreport.isoc.org/idref/draft-zorn-radius-keywrap
(2995 words)
|
|
| |
| | FIPS for Keyed-Hash Message Authentication Code (HMAC) |
| | The receiver computes the MAC on the received message using the same key and HMAC function as was used by the originator, and compares the result computed with the received MAC. | | | If the two values match, the message has been correctly received, and the receiver is assured that the message originator is a member of the community of users that share the key. | | | An HMAC function is used by the originator to produce a value (the MAC) that is formed by condensing the secret key and the message input. |
|
http://ftp.die.net/mirror/cryptome/nist010501.htm
(556 words)
|
|
| |
| | [No title] |
| | One is a mac based context where the compression function is assumed to be a mac. | | | Moreover they use the hash function (or its compression function) as a black box, so that widely available library code or hardware can be used to implement them in a simple way, and replaceability of the underlying hash function is easily supported. | | | We have also looked at block cipher based MACs: we analyzed the CBC MAC and then proposed and analyzed XOR MACSs. |
|
http://www-cse.ucsd.edu/users/mihir/papers/hmac.html
(483 words)
|
|
| |
| | [No title] |
| | HMAC() computes the message authentication code of the n bytes at d using the hash function evp_md and the key key which is key_len bytes long. | | | HMAC_Update() can be called repeatedly with chunks of the message to be authenticated (len bytes at data). | | | The following functions may be used if the message is not completely stored in memory: HMAC_Init() initializes a HMAC_CTX structure to use the hash function evp_md and the key key which is key_len bytes long. |
|
http://www.ibiblio.org/gferg/ldp/man/man3/hmac.3ssl.html
(246 words)
|
|
| |
| | RSA Security - 2.1.7 What are Message Authentication Codes? |
| | Unlike digital signatures, MACs are computed and verified with the same key, so that they can only be verified by the intended recipient. | | | In their algorithm, a provably secure stream cipher is used to split a message into two substreams and each substream is fed into a LFSR; the checksum is the final state of the two LFSRs. | | | Lai, Rueppel, and Woolven [LRW92] proposed a MAC based on stream ciphers (see Question 2.1.5). |
|
http://www.rsasecurity.com/rsalabs/node.asp?id=2177
(315 words)
|
|
| |
| | [No title] |
| | In particular, hash functions that perform well in software, and for which code is freely and widely available. | | | A published breaking of a message authentication scheme would lead to the replacement of that scheme, but would have no adversarial effect on information authenticated in the past. | | | In this document we present such a MAC mechanism based on cryptographic hash functions. |
|
http://www.ietf.org/rfc/rfc2104.txt
(2246 words)
|
|
| |
| | Poly1305-AES: a state-of-the-art message-authentication code |
| | Poly1305-AES computes a 16-byte authenticator of a message of any length, using a 16-byte nonce (unique message number) and a 32-byte secret key. | | | You can and should include it in your own programs, rather than going to the effort of linking to a shared library; the compiled code is between 6 and 10 kilobytes, depending on the CPU. | | | Almost all competing functions use a large table for each key; as the number of keys grows, those functions miss the cache and slow down dramatically. |
|
http://cr.yp.to/mac.html
(1008 words)
|
|
| |
| | New authentication code urged for digital data |
| | The National Institute of Standards and Technology (NIST) is recommending a new algorithm for authenticating digital data for federal agencies. | | | Within encryption algorithms, block ciphers are used to scramble the data after they are broken down into blocks. | | | In CMAC, the block cipher creates a digital tag that authorized parties can use to verify that the received message has not been altered. |
|
http://www.eurekalert.org/pub_releases/2005-06/nios-nac060205.php
(260 words)
|
|
| |
| | Message Authentication Codes |
| | Wegman and J. Carter, "New Hash Functions and their Use in Authentication and Set Equality", J. Computer and System Sciences 22 (1981), 265-279. | | | Flexible and Efficient Message Authentication in Hardware and Software | | | The Power of Verification Queries in Message Authentication and Authenticated Encryption |
|
http://www.cs.ut.ee/~helger/crypto/link/mac
(364 words)
|
|
| |
| | Generating a Message Authentication Code (MAC) (Java Developers Almanac Example) |
| | A MAC is like hash code for a sequence of bytes. | | | ); SecretKey key = keyGen.generateKey(); // Create a MAC object using HMAC-MD5 and initialize with key Mac mac = Mac.getInstance(key.getAlgorithm()); mac.init(key); String str = | | | Unlike a hash code, a MAC uses a secret key to generate the hash code, or more specifically, the |
|
http://javaalmanac.com/egs/javax.crypto/GenMac.html
(172 words)
|
|
| |
| | HMAC - Wikipedia, the free encyclopedia |
| | Any iterative cryptographic hash function, such as MD5 or SHA-1, may be used in the calculation of an HMAC; the resulting MAC algorithm is termed HMAC-MD5 or HMAC-SHA-1 accordingly. | | | FIPS PUB 198, The Keyed-Hash Message Authentication Code | | | A keyed-hash message authentication code, or HMAC, is a type of message authentication code (MAC) calculated using a cryptographic hash function in combination with a secret key. |
|
http://en.wikipedia.org/wiki/HMAC
(454 words)
|
|
| |
| | PMAC: A Parallelizable Message Authentication Code - Rogaway (ResearchIndex) |
| | Abstract: We describe a MAC (message authentication code) which is deterministic, parallelizable, and uses only ### invocations to MAC a non-empty string # (where # is the blocksize of the underlying block cipher). | | | The MAC can be proven secure (work to appear) in the reduction-based approach of modern cryptography. | | | PMAC: A Parallelizable Message Authentication Code - Rogaway (ResearchIndex) |
|
http://citeseer.ist.psu.edu/360769.html
(296 words)
|
|
| |
| | MESSAGE AUTHENTICATION CODES |
| | If the output matches the received code, then the message is received as being authentic. | | | Modifications are detected by comparing the received code with a checksum that is derived from the received message and a secret key. | | | The addition of a message authentication code enables recipients to detect whether or not a message has been modified. |
|
http://pigseye.kennesaw.edu/~kholden/project05.htm
(86 words)
|
|
| |
| | RFC 3537 (rfc3537) - Wrapping a Hashed Message Authentication Code (HMAC) |
| | One place that such an algorithm is used is for the Authenticated Data type in CMS (Cryptographic Message Syntax). | | | If data origination authentication is also desired, then the KEK distribution mechanism must provide data origin authentication of the KEK. | | | RFC 3537 (rfc3537) - Wrapping a Hashed Message Authentication Code (HMAC) |
|
http://www.faqs.org/rfcs/rfc3537.html
(1637 words)
|
|
| |
| | UMAC -- Message Authentication Webpage |
| | Large algorithmic changes were made in 2000 to make UMAC faster on short messages. | | | Small algorithmic changes were made in 2004 and a number of UMAC options were eliminated for simplicity. | | | UMAC is a message authentication code : an algorithm for generating authentication tags, which are used to ensure the authenticity and integrity of transmitted messages. |
|
http://www.cs.ucdavis.edu/~rogaway/umac
(146 words)
|
|
| |
| | Message Authentication Code |
| | If only sender and receiver know key and code matches: | | | Generate authentication code based on shared key and message | | | If message has sequence number, receiver assured of proper sequence |
|
http://www.cs.waikato.ac.nz/~312/lectures/ch18/sld026.htm
(29 words)
|
|
| |
| | DDJ>The HMAC Algorithm |
| | HMAC is currently an Internet draft that has been distributed by the Internet Engineering Task Force as Request For Proposal (RFP) 2104. | | | MAC algorithms involve the use of a secret key to generate a small block of data, known as a "message authentication code," that is appended to the message. | | | The message and code are transmitted to the intended recipient. |
|
http://www.ddj.com/documents/s=904/ddj9904e/9904e.htm
(765 words)
|
|
| |
| | System Error - File Not Found - Whassup ? |
| | Please consider upgrading your web browser since the command functions properly in all newer MS IE and Firefox browsers. | | | We use this html feature to reduce the redundant coding that repetition of our URL would cause to the size of our web pages. | | | Possibly your web browser can not handle the command used in our web page coding that automatically prefixes all web page links within our site with : |
|
http://www.infosyssec.com/forum/viewtopic.php?p=9395
(418 words)
|
|
| |
| | [No title] |
| | “ Ý R ó 0 ¨ Checksums ¨N Internal versus External IP headers: based on the entire TCP packet ó ¤ Ä ¨! Message authentication code (MAC) ª ó ÷ î ¨ MAC ª ¨ | | | Hash[(K+ XOR ipad)M)]] where K+ is the key padded out to size and opad, ipad are specified padding constants overhead is just 3 more hash calculations than the message needs alone can use MD-5 or SHA-1 ¡ ( P # |
|
http://www.cse.ohio-state.edu/~anish/694KNotes/694Lecture2.ppt
(1150 words)
|
|
| |
| | The Keyed-Hash Message Authentication Code (HMAC) (ResearchIndex) |
| | @misc{ security-keyedhash, author = "Category Computer Security", title = "The Keyed-Hash Message Authentication Code (HMAC)", url = "citeseer.ist.psu.edu/396784.html" } | | | Abstract: This standard describes a keyed-hash message authentication code (HMAC), a mechanism for message authentication using cryptographic hash functions. | | | The HMAC specification in this standard is a generalization of Internet RFC 2104, HMAC, Keyed-Hashing for Message Authentication,... |
|
http://citeseer.ist.psu.edu/396784.html
(291 words)
|
|
| |
| | (WO 02/073928) MESSAGE AUTHENTICATION |
| | The message authentication code of the third message may be additionally based on the second or the second and first messages. |
|
http://wipo.int/cgi-pct/guest/getbykey5?KEY=02/73928.020919&ELEMENT_SET=DECL
(106 words)
|
|
| |
| | Bellare - CBC |
| | Extended abstract in Advances in Cryptology - Crypto 94 Proceedings, Lecture Notes in Computer Science Vol. | | | Underlying our results is a technical lemma of independent interest, bounding the success probability of a computationally unbounded adversary in distinguishing between a random ml-bit to l-bit function and the CBC MAC of a random l-bit to l-bit function. | | | We provide its first formal justification, showing the following general lemma: that cipher block chaining a pseudorandom function gives a pseudorandom function. |
|
http://www-cse.ucsd.edu/users/mihir/papers/cbc.html
(160 words)
|
|
| |
| | (WO 01/30104) AUTHENTICATION OF SUBSCRIBER STATION |
| | (57) The present invention relates to a telecommunication system comprising: at least one subscriber station (MS) in the memory (9, 9') of which a secret key (Ki) is stored, and authentication means (1, 3, 4, VLR) for authenticating said subscriber station. |
|
http://wipo.int/cgi-pct/guest/getbykey5?KEY=01/30104.010426&ELEMENT_SET=DECL
(88 words)
|
|
| |
| | [No title] |
| | 0.5 by birthday paradox) have user sign the valid message, then substitute the forgery which will have a valid signature conclusion is that need to use larger MACs ¡Ö _ P j P + P + | | | 0 . 5 o f t h i s . C a n g e n e r a l i z e t h e p r o b l e m t o o n e w a n t i n g a m a t c h i n g p a i r f r o m a n y t w o s e t s , a n d s h o w n e e d 2 m / 2 i n e a c h t o g e t a m a t c h i n g m - b i t h a s h . N o t e t h a t c r e a t i n g m a n y m e s s a g e v a r i a n t s i s r e l a t i v e l y e a s y , e i t h e r b y r e w o r d i n g o r j u s t v a r y i n g t h e a m o u n t o f w h i t e - s p a c e i n t h e m e s s a g e . ¡8 ¾ |
|
http://www.cs.usna.edu/~hendrick/si486/ch11-1.ppt
(384 words)
|
|
|
