Optimal forgeries against polynomial-based MACs and GCM (Q1648808)

From MaRDI portal
Revision as of 01:52, 16 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Optimal forgeries against polynomial-based MACs and GCM
scientific article

    Statements

    title
    Optimal forgeries against polynomial-based MACs and GCM (English)
    0 references
    author
    Atul Luykx
    0 references
    Bart Preneel
    0 references
    publication date
    9 July 2018
    0 references
    zbMATH Keywords
    forgery
    0 references
    Wegman-Carter
    0 references
    authenticator
    0 references
    MAC
    0 references
    Galois Counter Mode (GCM)
    0 references
    universal hash
    0 references
    polynomial
    0 references
    cites work
    MAC Reforgeability
    0 references
    Q4941857
    0 references
    Q4341758
    0 references
    Q4941858
    0 references
    Q4249345
    0 references
    A Tight Bound for EMAC
    0 references
    Q4035708
    0 references
    Q4341731
    0 references
    Q3210171
    0 references

    Identifiers

    zbMATH DE Number
    6900687
    0 references
    OpenAlex ID
    W2794621867
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1648808&oldid=36406949"
    Powered by MediaWiki