Talk:VMAC

This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles

Low

This article has been rated as Low-importance on the project's importance scale.

This article is supported by WikiProject Software (assessed as Low-importance).

This article is supported by WikiProject Computer Security (assessed as Low-importance).

Things you can help WikiProject Computer Security with:

Article alerts will be generated shortly by AAlertBot. Please allow some days for processing. More information...

Answer question about Same-origin_policy
Review importance and quality of existing articles
Identify categories related to Computer Security
Tag related articles
Identify articles for creation (see also: Article requests)
Identify articles for improvement
Create the Project Navigation Box including lists of adopted articles, requested articles, reviewed articles, etc.
Find editors who have shown interest in this subject and ask them to take a look here.

Cryptography: Computer science Low‑importance

	This article is within the scope of WikiProject Cryptography, a collaborative effort to improve the coverage of Cryptography on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.CryptographyWikipedia:WikiProject CryptographyTemplate:WikiProject CryptographyCryptography articles
Low	This article has been rated as Low-importance on the importance scale.
	This article is supported by WikiProject Computer science (assessed as Low-importance).

Article does not fully specify how tags are produced edit

Latest comment: 2 years ago1 comment1 person in discussion

Currently, tag generation by VMAC is defined as follows:

    Tag = H_K1(M) + F_K2(Nonce)

This appears to be incorrect, the resultant tag may be out of bounds, meaning there should be some sort of modulus. From https://datatracker.ietf.org/doc/html/draft-krovetz-vmac-01#section-4.1 it would appear that it would be simply mod 2^{tag length} - 1. A second opinion, however, would be appreciated before an edit to make sure that this is correct. Joelabrahams (talk) 11:20, 4 August 2021 (UTC)Reply

Add topic