
	Where results make sense

Topic: Message authentication code

Related Topics

PMAC

Mac OS

List of cryptography topics

Advanced Encryption Standard

Lsh

Secure Shell

Unix shell

PuTTY

Unix

Eastern Orthodox

GNU

Client (computing)

Kasumi

List of the states of Brazil by population density

States of Brazil

	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).
		MACs differ from digital signatures, as MAC values are both generated and verified using the same secret key.
		This implies that the sender and receiver of a message must agree on keys before initiating communications, as is the case with symmetric encryption.
	en.wikipedia.org /wiki/Message_authentication_code (373 words)

	message authentication code - Article and Reference from OnPedia.com
		A MAC algorithm (sometimes termed a keyed hash function) accepts as input a secret key as well as the message, and produces a MAC (sometimes known as a tag).
		The MAC protects both a message's integrity—by ensuring that a different MAC will be produced if the message has changed—as well as its authenticity—because only someone who knows the secret key could have generated a valid MAC.
		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 and PMAC).
	www.onpedia.com /encyclopedia/Message-authentication-code (139 words)

	[No title] (Site not responding. Last check: 2007-10-21)
		Then a message authentication code is recomputed based on exactly the same algorithm and using the same parameters as were used at the transmitting end.
		The length of the message authentication code of the message received is examined at stages 702 and 706.
		The message authentication code is checked, the message is decoded, etc. using the same algorithm and parameters as were used at the transmitting end.
	www.wipo.int /cgi-pct/guest/getbykey5?KEY=02/73928.020919&ELEMENT_SET=DECL (7735 words)

	[No title] (Site not responding. Last check: 2007-10-21)
		The ob- ject is achieved by a method of the invention for identifying an authentication message generated by an external attacker, the method comprising receiving the authenticating message comprising an input.
		The authentication centre of the invention is characterized in that the authentication centre is ar- ranged to produce said input by utilizing a random number generated by the random number generator and a first algorithm.
		The authentication centre transmits the input RAND and response SRES to the VLR.
	www.wipo.int /cgi-pct/guest/getbykey5?KEY=01/30104.010426&ELEMENT_SET=DECL (6164 words)

	Public Key Digital Signatures
		This technology uses a combination of a message authentication code (MAC) to guarantee the integrity of data and unique features of paired public and private keys associated with public key cryptography to uniquely authenticate the sender [Schneier 96, Abrams 95].
		Positive verification of message integrity is provided by the use of a message authentication code (sometimes called a manipulation detection code or a cryptographic checksum) that is produced by a message digest (sometimes called a data hashing) function.
		The same message digest functions and public key cryptography algorithm used to process the digital signature must be used by both the sender and receiver.
	www.sei.cmu.edu /str/descriptions/pkds_body.html (1165 words)

	HMAC - Wikipedia, the free encyclopedia
		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.
		As with any MAC, it may be used to simultaneously verify both the data integrity and the authenticity of a message.
		FIPS PUB 198, The Keyed-Hash Message Authentication Code
	en.wikipedia.org /wiki/HMAC (452 words)

	RSA Security - 2.1.7 What are Message Authentication Codes?
		A message authentication code (MAC) is an authentication tag (also called a checksum) derived by applying an authentication scheme, together with a secret key, to a message.
		Hash function-based MACs (often called HMACs) use a key or keys in conjunction with a hash function (see Question 2.1.6) to produce a checksum that is appended to the message.
		The basic idea is to encrypt the message blocks using DES CBC and output the final block in the ciphertext as the checksum.
	www.rsasecurity.com /rsalabs/node.asp?id=2177 (315 words)

	[No title]
		Typically, message authentication codes are used between two parties that share a secret key in order to validate information transmitted between these parties.
		Truncated output A well-known practice with message authentication codes is to truncate the output of the MAC and output only part of the bits (e.g., [MM, ANSI]).
		Message authentication, as opposed to encryption, has a "transient" effect.
	www.ietf.org /rfc/rfc2104.txt (2246 words)

	CBC-MAC - Wikipedia, the free encyclopedia
		By encrypting a given plaintext with some block cipher algorithm in CBC mode, we can create a chain of blocks, such that each block is dependent on the proper encryption of the block before it.
		Since there is this interdependence, we can use this to ensure that none of the plaintext bits that were input into the encryption have been changed, thus creating the message authentication code.
		The security of the cipher block chaining message authentication code.
	en.wikipedia.org /wiki/CBC-MAC (308 words)

	Message Authentication Codes in Schannel [Security] (Site not responding. Last check: 2007-10-21)
		A Message Authentication Code (MAC) is used to detect message tampering and forgery.
		The message recipient generates the MAC again, using the shared session key and message body, and compares the generated MAC to the MAC received from the sender.
		In Schannel protocols, the algorithm used to generate the MAC is determined by the cipher suite in use by the sender and recipient.
	msdn.microsoft.com /library/en-us/secauthn/security/message_authentication_codes_in_schannel.asp?frame=true (153 words)

	Caveat Lector: Authentication, the Forgotten, Should-be Predominant (Site not responding. Last check: 2007-10-21)
		When communicating a message, denoted by m, Alice uses the secret key, K, to compute a code with the general function of MAC(K, m); during transit, she sends this computed code along with the message.
		The code, or “tag,” and key are of a fixed length, while the message is of arbitrary length.
		There may be a situation where Alice authenticates a message which is a concatenation of multiple data fields, and Bob must know the appropriate parsing information necessary to decompose that concatenation into its separate data fields, otherwise, it's possible for illegitimate data to be authenticated, by Bob's accident or Eve's attack.
	www.windowsecurity.com /pages/article_p.asp?id=1592 (1533 words)

	[No title] (Site not responding. Last check: 2007-10-21)
		To generate the authentication tag on a given message, a "universal" hash function is applied to the message and key to produce a short, fixed-length hash value, and this hash value is then xor'ed with a key-derived pseudorandom pad.
		Tag Lengths and Forging Probability A MAC algorithm is used to authenticate messages between two parties that share a secret MAC key K. An authentication tag is computed for a message using K and, in some MAC algorithms such as UMAC, a nonce.
		Breaking the MAC means that the attacker is able to generate, on its own, with no knowledge of the key K, a new message M (i.e., one not previously transmitted between the legitimate parties) and to compute on M a correct authentication tag under the key K. This is called a forgery.
	ftp.rfc-editor.org /in-notes/rfc4418.txt (5049 words)

	[No title] (Site not responding. Last check: 2007-10-21)
		The MAC algorithms defined for this option use the key as a direct input to the algorithm, so there is no need to additionally include it in the MAC data.
		Authentication Data Size The size of the authentication data field varies depending on the output of the MAC algorithm and whether or not the MAC algorithm requires a sequence number field.
		MAC algorithms requiring a nonce require an additional four bytes to carry a sequence number in the authentication data portion of the option.
	www.ietf.org /internet-drafts/draft-weis-tcp-mac-option-00.txt (3461 words)

	Clink HTTP Authentication - Protocol - Message Authentication Code (Site not responding. Last check: 2007-10-21)
		The recipient of the message also computes its appropriate message authentication code and compares the received value with the computed value.
		The equality of MACs is not sufficient to establish message entity-body integrity.
		These two stages permit certain message invalidity conditions to be discovered by the recipient before embarking on the potentially expensive process of hashing of an arbitrarily long entity-body.
	clink.org /1.0/authentication/section/Message_Authentication_Code.html (215 words)

	[No title]
		HMAC is a hash function based message authentication code that was designed to meet the requierments of the IPSEC working group in the IETF, and is now a standard.
		The main technical paper on the subject, containing the formal security analysis, is Keying hash functions for message authentication.
		One is a mac based context where the compression function is assumed to be a mac.
	www.cs.ucsd.edu /users/mihir/papers/hmac.html (483 words)

	[No title] (Site not responding. Last check: 2007-10-21)
		MAC Both the length and value of the MAC field depend upon the algorithm specified by the value of the MAC Type field.
		Request Messages For requests (e.g., CoA-Request [RFC3576], Accounting- Request [RFC2866], etc.), the value of the MAC field is a hash of the entire packet except the Request Authenticator, using a shared secret as the key, as follows.
		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.
	www.faqs.org /ftp/pub/pub/internet-drafts/draft-zorn-radius-keywrap-09.txt (2994 words)

	MCSoft MCMAC ActiveX DLL - Message Authentication Code for Programmers - Algorithms - HMAC (Site not responding. Last check: 2007-10-21)
		The used algorithms are one-way functions and produce from a message of arbitrary length a "finger print" in form of a code of defined length.
		The purpose of a MAC is to authenticate both the source of a message and its integrity without the use of any additional mechanisms.
		The receiver computes the MAC on the received message using the same key and MAC function as was used by the sender, and compares the result computed with the received MAC.
	www.mcsoft.at /mcmac_en.html (425 words)

	MESSAGE AUTHENTICATION CODES (Site not responding. Last check: 2007-10-21)
		The addition of a message authentication code enables recipients to detect whether or not a message has been modified.
		A message authentication code is a sequence of bits added to the original message.
		Modifications are detected by comparing the received code with a checksum that is derived from the received message and a secret key.
	pigseye.kennesaw.edu /~kholden/project05.htm (86 words)

	Definition: message authentication code (Site not responding. Last check: 2007-10-21)
		A bit string that is a function of both data (either plaintext or ciphertext) and a secret key, and that is attached to the data in order to allow data authentication.
		Note: The function used to generate the message authentication code must be a one-way function.
		Data associated with an authenticated message allowing a receiver to verify the integrity of the message.
	www.atis.org /tg2k/_message_authentication_code.html (99 words)

	hmac(3): HMAC message authentication code - Linux man page
		a keyed hash function used for message authentication, which is based on a hash function.
		() 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_Final() places the message authentication code in md, which must have space for the hash function output.
	www.die.net /doc/linux/man/man3/hmac.3.html (318 words)

	Generating a Message Authentication Code (MAC) (Java Developers Almanac Example)
		A MAC is like hash code for a sequence of bytes.
		Unlike a hash code, a MAC uses a secret key to generate the hash code, or more specifically, the
		A MAC is generally used to check the integrity or validity of information based on a secret key.
	javaalmanac.com /egs/javax.crypto/GenMac.html (172 words)

	96Crypt Help
		Using the block cipher, a message is encrypted in CBC mode.
		The last block is taken as the MAC of the message.
		messages, the last block is encrypted once again with a different key.
	www.erightsoft.com /help/HMACAlgo.htm (1100 words)

	PMAC: A Parallelizable Message Authentication Code - Rogaway (ResearchIndex) (Site not responding. Last check: 2007-10-21)
		Abstract: We describe a MAC (message authentication code) which is deterministic, parallelizable, and uses only ### #### block-cipher 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.
		The MAC is similar to one recently suggested by Gligor and Donescu [5].
	citeseer.ist.psu.edu /360769.html (412 words)

	MAC: Message Authentication Code (Site not responding. Last check: 2007-10-21)
		Message Authentication Code (MAC) is a short piece of cryptographic checksums used to authenticate a message.
		A MAC algorithm accepts as input a secret key and an arbitrary-length message to be authenticated, and outputs a MAC.
		The MAC value protects both a message's integrity as well as its authenticity, by allowing verifiers to detect any changes to the message content.
	www.javvin.com /networksecurity/MAC2.html (83 words)

	Cryptography with Java > Message Authentication Code (Site not responding. Last check: 2007-10-21)
		Message Authentication Code or MAC is obtained by applying a secret key to the message digest so that only the holder of the secret key can compute the MAC from the digest and hence, the message.
		This method thwarts the threat posed by a malicious interceptor who could modify the message and replace the digest with the digest of the modified message, for the interceptor won't have access to the secret key.
		The example program to illustrate MAC computation is similar to the one for Message Digest.
	www.phptr.com /articles/article.asp?p=170967&seqNum=6 (350 words)

	Java Cryptography Extension
		Provider vendors can either modify their provider to follow the recommended approach for authenticating the framework, or put in a conditional so that the framework authentication code is only executed when the provider is being run with JCE 1.2.1.
		A Mac object is always initialized with a (secret) key and may optionally be initialized with a set of parameters, depending on the underlying MAC algorithm.
		With some MAC algorithms, the (secret-)key algorithm associated with the (secret-)key object used to initialize the Mac object does not matter (this is the case with the HMAC-MD5 and HMAC-SHA1 implementations of the SunJCE provider).
	java.sun.com /j2se/1.4.2/docs/guide/security/jce/JCERefGuide.html (11048 words)

	sci.crypt: Re: The Poly1305-AES message-authentication code
		Previous message: David Wagner: "Re: The Poly1305-AES message-authentication code"
		The only reason it's 2^63 chosen messages is to allow 2^63 forgeries.
		n is used for a limited number of messages m.
	www.derkeiler.com /Newsgroups/sci.crypt/2004-11/0134.html (294 words)

	sci.crypt: Re: The Poly1305-AES message-authentication code
		Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
		message, it creates a risk that the shared secret could be leaked or
		Perhaps it is leaked because of a side channel.
	www.derkeiler.com /Newsgroups/sci.crypt/2004-11/0183.html (502 words)

	Poly1305-AES: a state-of-the-art message-authentication code
		Poly1305-AES is a state-of-the-art secret-key message-authentication code suitable for a wide variety of applications.
		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.
		Attackers can't modify or forge messages if the message sender transmits an authenticator along with each message and the message receiver checks each authenticator.
	cr.yp.to /mac.html (1008 words)

Try your search on: Qwika (all wikis)