Factbites
 Where results make sense
About us   |   Why use us?   |   Reviews   |   PR   |   Contact us  

Topic: OMAC (cryptography)


Related Topics

In the News (Thu 31 Dec 09)

  
 Message Authentication Code - free-definition   (Site not responding. Last check: 2007-10-14)
In cryptography, a message authentication code (MAC) algorithm (also keyed-hash function) is an algorithm for generating a short string of information used to authenticate a message.
A MAC algorithm involves a one-way hash function or block cipher and accepts a secret key as well as a message as input and produces a MAC (sometimes known as tag).
The Message Authentication Code (MAC) is an ANSI standard for a short string of information used to authenticate a message which is based on DES, and is also known as the Data Authentication Code.
www.free-definition.com /Message-authentication-code.html   (209 words)

  
 List of cryptography topics   (Site not responding. Last check: 2007-10-14)
This page aims to alphabetically list articles that are primarily related to cryptography.
There is a categorised and (somewhat) annotated list of the same articles in subject groupings at Topics in cryptography; it will probably be more useful to those attempting to make some sense of the field.
FEAL -- Feistel cipher -- Financial cryptography -- FISH (cryptography) -- Fortezza -- Frank A. Stevenson -- Frank Rowlett -- FreeLIP -- Frequency analysis -- Friedrich Kasiski -- Fritz-chip --
factsite.co.uk /en/wikipedia/l/li/list_of_cryptography_topics.html   (571 words)

  
 [No title]
It is a rule of the thumb in cryptography to use different keys for different applications.
The name of a family of protocols that allow mutual authentication and that are specified in [EAKD] OMAC One Key CBC-MAC, a method to generate a message authentication code, please refer to [OMAC] for more details PSK Pre-shared key.
It is intended to mitigate the risks associated with password usage in cryptography, typically dictionary attacks.
eappsk.chez.tiscali.fr /draft-bersani-eap-psk-01.txt   (6487 words)

  
 AES Code
Except for OMAC (which provides authentication only) these modes provide both encryption and authentication and do so typically for about twice the cost of encryption alone.
This is my implementation of OMAC, a MAC that improves on the traditional CBC based MAC by eliminating a number of security weaknesses for partial length blocks.
OMAC was designed by Tetsu Iwata who has produced a description to assist in implementation here.
fp.gladman.plus.com /AES   (1688 words)

  
 Message authentication code - Wikipedia, the free encyclopedia   (Site not responding. Last check: 2007-10-14)
In cryptography, a message authentication code (MAC) is a short piece of information used to authenticate a message.
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.info-en.com /index.php/Message_authentication_code   (138 words)

  
 A Companion to\ User's Guide to Cryptography and Standards   (Site not responding. Last check: 2007-10-14)
It is interesting to note that both modern cryptography and information theory owe a huge debt to the pioneering work of Shannon, who published enormously influential papers on both topics in the post-war years [500,501].
As we have stated, one of the main strengths of lattice based cryptography is that it seems to be resistent to attacks made by quantum computers.
TMAC and OMAC were proposed by Iwata and Kurosawa [349,379], and are derived from a scheme known as XCBC (due to Black and Rogaway [64]).
www.isg.rhul.ac.uk /ugcs/Companion_v1.1.html   (12316 words)

  
 Roxen Community:   (Site not responding. Last check: 2007-10-14)
OMAC was chosen because of its handling of arbitrary length messages and its design simplicity (though some care must be taken in its implementation to avoid side channel attacks, please refer to [EAX]).
EAX was mainly chosen because it strongly relied on OMAC in its design and OMAC had already been chosen in EAP-PSK for the authentication part.
Due to the use of symmetric cryptography and the security proofs of its cryptographic components, EAP-PSK is believed not to be vulnerable to man-in-the-middle attacks.
community.roxen.com /developers/idocs/drafts/draft-bersani-eap-psk-01.html   (7718 words)

  
 A Companion to\ User's Guide to Cryptography and Standards   (Site not responding. Last check: 2007-10-14)
It is interesting to note that both modern cryptography and information theory owe a huge debt to the pioneering work of Shannon, who published enormously influential papers on both topics in the post-war years [491,492].
TMAC and OMAC were proposed by Iwata and Kurosawa [343,372], and are derived from a scheme known as XCBC (due to Black and Rogaway [63]).
More technical information on the use of elliptic curves in cryptography can be found in Blake, Seroussi and Smart [67], and the security of ECDSA is discussed in detail in [68].
www.isg.rhul.ac.uk /ugcs/Companion_v1.01.html   (12269 words)

  
 discuss@bloom-picayune: [13538] in cryptography@c2.net mail archive
In response to public comments on the draft, NIST posted a consultation paper that proposed a revision of the draft that would focus on the EMAC construction that underlies RMAC.
In response to further public input, NIST has decided to replace RMAC and EMAC altogether with the OMAC variation of the XCBC algorithm.
These two papers, and other information on the modes development effort, are available through the modes home page, http://www.nist.gov/modes/.=20 =20 NIST welcomes public comments on the OMAC variation of the XCBC algorithm in advance of the formal public comment period that will follow posting of the revised draft.
diswww.mit.edu /bloom-picayune/crypto/13538   (231 words)

  
 Cryptology ePrint Archive   (Site not responding. Last check: 2007-10-14)
In this paper, we present One-key CBC MAC (OMAC) and prove its security for arbitrary length messages.
OMAC takes only one key, $K$ ($k$ bits) of a block cipher $E$.
The saving of the key length makes the security proof of OMAC substantially harder than those of XCBC and TMAC.
eprint.iacr.org /2002/180   (103 words)

  
 On the security of XCBC, TMAC and OMAC (ResearchIndex)
Abstract: The security provided by the XCBC, TMAC and OMAC schemes is analysed and compared with other MAC schemes.
The results imply that there is relatively little to be gained practically through the introduction of these schemes by comparison with other well-established MAC functions.
Moreover, TMAC and OMAC possess design weaknesses which enable part of the secret key to be recovered much more easily than would ideally be the case --- design changes are suggested which alleviate this problem....
citeseer.ist.psu.edu /644295.html   (386 words)

  
 The Advanced Encryption Standard -- from Mathematica Information Center
This item contains a Mathematica implementation of the cryptosystem AES (Advanced Encryption Standard, also known as Rijndael), both in notebook and package formats.
The implementation covers ECB, CBC, and CFB128 modes, as well as AES-based CBC-MAC authentication, including OMAC, and accepts all the keylengths defined in the standard.
It can encrypt both text strings and binary files and also includes some tests.
library.wolfram.com /infocenter/MathSource/5130   (100 words)

  
 Two bugs in LibTomCrypt [v0.92] and one in LibTomMath [v0.28   (Site not responding. Last check: 2007-10-14)
You've got CTR and OMAC so it can't be hard.
Just for HMAC and OMAC constructions you have to use the tables.
I added OMAC because it is becomming a standard
www.groupsrv.com /science/post-53903.html   (2316 words)

  
 The EAP-PSK Protocol: a Pre-Shared Key EAP Method
Indeed, it is a rule of the thumb in cryptography to use different keys for different applications.
Since it was chosen to restrict to a single cryptographic primitive from symmetric cryptography, namely the block cipher AES-128, it appears that it is not possible to provide "reasonable" identity protection without failing to meet the simplicity goal.
In case only symmetric cryptography is used, only a weak form of identity protection may be offered, namely pseudonym management.
www.tschofenig.com /drafts/draft-bersani-eap-psk-07.html   (11817 words)

  
 Re: [Cfrg] OMAC Query   (Site not responding. Last check: 2007-10-14)
Yes, but I would not rush to standardize on OMAC because NIST has standardized on it.
I would also strongly consider MAC constructs based on universal hash functions, which have a number of advantages to OMAC.
John On Mon, Nov 03, 2003 at 08:30:53AM -0800, Walker, Jesse wrote: > Do folks believe that the analysis and understanding of OMAC is > sufficiently mature to incorporate it into IETF protocols?
www.ietf.org /mail-archive/web/cfrg/current/msg00350.html   (89 words)

  
 Re: NIST selects the OMAC as new block cipher mode
I'm thinking of adding OMAC to LibTomCrypt however I have a question not resolved in the paper [or at least I didn't see it].
NIST selects the OMAC as new block cipher mode Mads Rasmussen
Re: NIST selects the OMAC as new block cipher mode tom st denis
www.mail-archive.com /cryptography@metzdowd.com/msg00187.html   (137 words)

  
 LibTom Project
LibTomMath is a software library optimized for arbitrary-precision integer arithmetic that has many features suitable for use in cryptography applications.
The library includes over a hundred functions that cover a variety of tasks such as basic addition, subtraction, multiplication, division as well as more advanced algorithms such as fast modular reduction, modular exponentiation, jacobi symbol computation, greatest common divisor and least common multiple.
LibTomCrypt is a software library that implements many cryptographic protocols, such as various block ciphers (AES), and one-way hash functions (WHIRLPOOL), as well as several Message authentication code algorithms (HMAC, OMAC PMAC), and finally several public key algorithms (ECC, RSA, Diffie-Hellman and DSA).
www.brainyencyclopedia.com /encyclopedia/l/li/libtom_project.html   (244 words)

  
 [eap] Re: SHA-0 Broken   (Site not responding. Last check: 2007-10-14)
But history tells us that such discoveries are usually followed by > a series of bigger discoveries that widen the breach, to the point that the > broken primitive becomes unusable.
I'd like explicitly state that I'm aware of the fact, that this is the EAP mailing list and not a cryptography mailing list and that I immediately stop talking about crypto topics.
Nevertheless, most of us are certainly no designated experts in the cryptography area and are reliant on research results of *real* cryptographers like him.
mail.frascone.com /pipermail/eap/2004-August/002765.html   (495 words)

  
 List of cryptography topics   (Site not responding. Last check: 2007-10-14)
__NOTOC__ This page aims to alphabetically list articles that are primarily related to cryptography.
FEAL -- Feistel cipher -- Fialka -- Financial cryptography -- FIREFLY -- FISH (cryptography) -- FNBDT -- Fortezza -- Frank A. Stevenson -- Frank Rowlett -- Frequency analysis -- Friedrich Kasiski -- Fritz-chip -- FROG --
ICE (cipher) -- ID-based cryptography -- Identification friend or foe -- I.
www.worldhistory.com /wiki/L/List-of-cryptography-topics.htm   (716 words)

  
 Message Authentication Code - TheBestLinks.com - Block cipher, Cryptography, Hash function, TheBestLinks.com:Find or ...   (Site not responding. Last check: 2007-10-14)
Message Authentication Code - TheBestLinks.com - Block cipher, Cryptography, Hash function, TheBestLinks.com:Find or fix a stub,...
Message Authentication Code, Block cipher, Cryptography, Hash function...
Popular MAC algorithms include HMAC, OMAC and PMAC.
www.thebestlinks.com /Message_Authentication_Code.html   (257 words)

  
 WDIFF
OMAC had already been chosen in EAP-PSK for the authentication part.
public key cryptography (namely Diffie-Hellman key exchange) and shared key/password support in TLS is still work in progress.
Since the processing and memory resources required by a standard EAP- PSK authentication are already very light, we chose not to try any hazardous optimization that would anyway have probably ended to be more complex, to make more efficient computations to provide fast reconnect.
www.potaroo.net /cgi-bin/htmlwdiff?f1=../all-ids/draft-bersani-eap-psk-02.txt&f2=../all-ids/draft-bersani-eap-psk-01.txt   (6304 words)

  
 [eap] Re: SHA-0 Broken   (Site not responding. Last check: 2007-10-14)
But history tells us that such discoveries are usually followed by > > a series of bigger discoveries that widen the breach, to the point that the > > broken primitive becomes unusable.
> > I'd like explicitly state that I'm aware of the fact, that this is the EAP > mailing list and not a cryptography mailing list and that I immediately > stop talking about crypto topics.
> Nevertheless, most of us are certainly no designated experts in the > cryptography area and are reliant on research results of *real* cryptographers > like him.
mail.frascone.com /pipermail/eap/2004-August/002766.html   (674 words)

  
 ISA | Calendar of Events
However, as the recent Wireless Ethernet security fiasco has proven, it can be close to useless when improperly used.
This seminar introduces you to the world of cryptography, focusing on how these systems can be effectively deployed on the typical plant floor.
Learn how cryptography works and why careful deployment is so critical to success
www.isa.org /Template.cfm?Section=Events&template=/conference/ShortDescription.cfm&ConferenceID=811   (352 words)

  
 Cryptographic hash function - Infosecpedia   (Site not responding. Last check: 2007-10-14)
It is also know as message integrity code (MIC), modification detect code (MDC) and keyed message digest.
Cryptographic hash functions are much less studied than other cryptography areas like symmetric and asymmetric ciphers.
Today most available functions are based on the MD4 algorithm.
www.infosecpedia.org /pedia/index.php/Cryptographic_hash_function   (357 words)

  
 Cryptology ePrint Archive   (Site not responding. Last check: 2007-10-14)
Stronger Security Bounds for OMAC, TMAC and XCBC
OMAC, TMAC and XCBC are CBC-type MAC schemes which are provably secure for arbitrary message length.
secret-key cryptography / modes of operation, message authentication codes, block cipher, provable security.
eprint.iacr.org /2003/082   (124 words)

  
 Algorithmic Solutions Software GmbH: LEDA
Convince yourself how easy it is: Have a look at an example!
LEDA has all you need for symmetric key cryptography!
It also shows you how seamlessly cryptography integrates with compression.
www.algorithmic-solutions.com /enleda.htm   (481 words)

  
 WDIFF   (Site not responding. Last check: 2007-10-14)
PSK should be cryptographically separated from any other PSK or else the security of EAP-PSK might be voided.
The reasons that motivated such a choice are: o This value is exactly 128 bit long since the tag length chosen for OMAC is 128 bits Bersani Expires
August 2004 [Page 28] INTERNET-DRAFT EAP PSK February 2004 2004 Due to the use of symmetric cryptography and the security proofs of its cryptographic components, EAP-PSK is believed not to be vulnerable to man-in-the-middle attacks.
bgp.potaroo.net /cgi-bin/htmlwdiff?f1=./old-ids/draft-bersani-eap-psk-01.txt&f2=./old-ids/draft-bersani-eap-psk-01.txt-86237.txt   (8123 words)

  
 America Encyclopedia   (Site not responding. Last check: 2007-10-14)
The following list was generated by Securiger on 3 May 2004 as a (very rough) guide for which cryptography articles require work.
All articles listed in list of cryptography topics were scanned by a simple, read-only bot, (with a long sleep loop between reads to play nice) and the number of bytes counted.
Accuracy not guaranteed, and I do not plan to update this list frequently.
www.americapedia.com /index.php?title=User:Securiger/Crypto_Stubs   (92 words)

Try your search on: Qwika (all wikis)

Factbites
  About us   |   Why use us?   |   Reviews   |   Press   |   Contact us  
Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.