On the multiplicative complexity of Boolean functions and bitsliced higher-order masking (Q1695993)

From MaRDI portal
Revision as of 19:36, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
scientific article

    Statements

    title
    On the multiplicative complexity of Boolean functions and bitsliced higher-order masking (English)
    0 references
    author
    Dahmun Goudarzi
    0 references
    Matthieu Rivain
    0 references
    publication date
    14 February 2018
    0 references
    describes a project that uses
    PRESENT
    0 references
    Serpent
    0 references
    SC2000
    0 references
    CLEFIA
    0 references

    Identifiers

    zbMATH DE Number
    6838315
    0 references
    OpenAlex ID
    W2497251496
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1695993&oldid=31571891"
    Powered by MediaWiki