| 发明名称 | Robust MAC aggregation with short MAC tags | ||
| 摘要 | Method of producing an aggregated message authentication code (MAC). The method comprises generating or receiving, in a computer processor, a first message and its first MAC tag (m1, t1) and computing, in the computer processor, a first hashed message-tag pair H(m1, t1), where H is a cryptographic hash function. The method comprises generating or receiving, in the computer processor, a second message and its second MAC tag (m2, t2) and computing, in the computer processor, a second hashed message-tag pair H(m2, t2). The method comprises computing, in the computer processor, an aggregated MAC (At1) by an addition operation, as follows: At1=(H(m1, t1)+H(m2, t2)) modulo N, where N is a natural number equal to two or greater. | ||
| 申请公布号 | US9438425(B2) | 申请公布日期 | 2016.09.06 |
| 申请号 | US201414460791 | 申请日期 | 2014.08.15 |
| 申请人 | Alcatel Lucent | 发明人 | Kolesnikov Vladimir |
| 分类号 | H04L9/32 | 主分类号 | H04L9/32 |
| 代理机构 | Parker Justiss, PC | 代理人 | Parker Justiss, PC |
| 主权项 | 1. A method of producing an aggregated message authentication code (MAC), comprising: generating or receiving, in a computer processor, a first message and its first MAC tag (m1, t1); computing, in the computer processor, a first hashed message-tag pair H(m1, t1), where H is a cryptographic hash function; generating or receiving, in the computer processor, a second message and its second MAC tag (m2, t2); computing, in the computer processor, a second hashed message-tag pair H(m2, t2); computing, in the computer processor, an aggregated MAC (At1) by an addition operation, as follows: At1=(H(m1,t1)+H(m2,t2))modulo N, where N is selected to equal a natural number equal to two or greater. | ||
| 地址 | Boulogne-Billancourt FR | ||