Fast message authentication using efficient polynomial evaluation

Valentine Afanassiev; Christian Gehrmann; Ben Smeets

doi:10.1007/bfb0052346

Fast message authentication using efficient polynomial evaluation

Valentine Afanassiev, Christian Gehrmann, Ben Smeets

Institutionen för elektro- och informationsteknik

Institute for Information Transmission Problems Russian Academy of Sciences

Forskningsoutput: Kapitel i bok/rapport/Conference proceeding › Konferenspaper i proceeding › Peer review

Sammanfattning

Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexity software polynomial evaluation procedure, that for large message sizes gives a MAC that has about the same low software complexity as for bucket hashing but requires only small keys and has better security characteristics.

Originalspråk	engelska
Titel på värdpublikation	Fast Software Encryption
Undertitel på värdpublikation	4th International Workshop, FSE 1997, Proceedings
Redaktörer	Eli Biham
Förlag	Springer
Sidor	190-204
Antal sidor	15
ISBN (tryckt)	3540632476, 9783540632474
DOI	https://doi.org/10.1007/bfb0052346
Status	Published - 1997
Evenemang	4th International Workshop on Fast Software Encryption, FSE 1997 - Haifa, Israel Varaktighet: 1997 jan. 20 → 1997 jan. 22

Publikationsserier

Namn	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volym	1267
ISSN (tryckt)	0302-9743
ISSN (elektroniskt)	1611-3349

Konferens

Konferens	4th International Workshop on Fast Software Encryption, FSE 1997
Land/Territorium	Israel
Ort	Haifa
Period	1997/01/20 → 1997/01/22

Bibliografisk information

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.

Ämnesklassifikation (UKÄ)

Datavetenskap (datalogi)

Tillgång till dokument

10.1007/bfb0052346

Citera det här

Afanassiev, V., Gehrmann, C., & Smeets, B. (1997). Fast message authentication using efficient polynomial evaluation. I E. Biham (Red.), Fast Software Encryption : 4th International Workshop, FSE 1997, Proceedings (s. 190-204). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1267). Springer. https://doi.org/10.1007/bfb0052346

Afanassiev, Valentine ; Gehrmann, Christian ; Smeets, Ben. / Fast message authentication using efficient polynomial evaluation. Fast Software Encryption : 4th International Workshop, FSE 1997, Proceedings. redaktör / Eli Biham. Springer, 1997. s. 190-204 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{9976cc15019046aa846b94984d9855df,

title = "Fast message authentication using efficient polynomial evaluation",

abstract = "Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexity software polynomial evaluation procedure, that for large message sizes gives a MAC that has about the same low software complexity as for bucket hashing but requires only small keys and has better security characteristics.",

keywords = "Message authentication, Polynomial evaluation, Software MAC generation, Universal hash functions",

author = "Valentine Afanassiev and Christian Gehrmann and Ben Smeets",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; 4th International Workshop on Fast Software Encryption, FSE 1997 ; Conference date: 20-01-1997 Through 22-01-1997",

year = "1997",

doi = "10.1007/bfb0052346",

language = "English",

isbn = "3540632476",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "190--204",

editor = "Eli Biham",

booktitle = "Fast Software Encryption",

address = "Germany",

}

Afanassiev, V, Gehrmann, C & Smeets, B 1997, Fast message authentication using efficient polynomial evaluation. i E Biham (red.), Fast Software Encryption : 4th International Workshop, FSE 1997, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1267, Springer, s. 190-204, 4th International Workshop on Fast Software Encryption, FSE 1997, Haifa, Israel, 1997/01/20. https://doi.org/10.1007/bfb0052346

Fast message authentication using efficient polynomial evaluation. / Afanassiev, Valentine; Gehrmann, Christian ; Smeets, Ben.

Fast Software Encryption : 4th International Workshop, FSE 1997, Proceedings. red. / Eli Biham. Springer, 1997. s. 190-204 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1267).

Forskningsoutput: Kapitel i bok/rapport/Conference proceeding › Konferenspaper i proceeding › Peer review

TY - GEN

T1 - Fast message authentication using efficient polynomial evaluation

AU - Afanassiev, Valentine

AU - Gehrmann, Christian

AU - Smeets, Ben

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1997.

PY - 1997

Y1 - 1997

N2 - Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexity software polynomial evaluation procedure, that for large message sizes gives a MAC that has about the same low software complexity as for bucket hashing but requires only small keys and has better security characteristics.

AB - Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexity software polynomial evaluation procedure, that for large message sizes gives a MAC that has about the same low software complexity as for bucket hashing but requires only small keys and has better security characteristics.

KW - Message authentication

KW - Polynomial evaluation

KW - Software MAC generation

KW - Universal hash functions

U2 - 10.1007/bfb0052346

DO - 10.1007/bfb0052346

M3 - Paper in conference proceeding

AN - SCOPUS:21744457386

SN - 3540632476

SN - 9783540632474

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 190

EP - 204

BT - Fast Software Encryption

A2 - Biham, Eli

PB - Springer

T2 - 4th International Workshop on Fast Software Encryption, FSE 1997

Y2 - 20 January 1997 through 22 January 1997

ER -

Afanassiev V, Gehrmann C , Smeets B. Fast message authentication using efficient polynomial evaluation. I Biham E, redaktör, Fast Software Encryption : 4th International Workshop, FSE 1997, Proceedings. Springer. 1997. s. 190-204. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/bfb0052346

Fast message authentication using efficient polynomial evaluation

Sammanfattning

Publikationsserier

Konferens

Bibliografisk information

Ämnesklassifikation (UKÄ)

Tillgång till dokument

Fingeravtryck

Citera det här