Analysis of a key distribution scheme in secure multicasting
This article presents an analysis of the secure key broadcasting scheme proposed by Wu, Ruan, Lai and Tseng [Proceedings of the 25th Annual IEEE Conference on Local Computer Networks (2000), 208–212]. The study of the parameters of the system is based on a connection with a special type of symmetric...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2012-06-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2012-0005 |
id |
doaj-f84cbb481e004a4a82f20adb88899488 |
---|---|
record_format |
Article |
spelling |
doaj-f84cbb481e004a4a82f20adb888994882021-09-06T19:40:43ZengDe GruyterJournal of Mathematical Cryptology1862-29761862-29842012-06-0161698010.1515/jmc-2012-0005Analysis of a key distribution scheme in secure multicastingMaze Gérard0Mathematics Institute, University of Zürich, Winterthurerstr. 190, CH-8057 Zürich, SwitzerlandThis article presents an analysis of the secure key broadcasting scheme proposed by Wu, Ruan, Lai and Tseng [Proceedings of the 25th Annual IEEE Conference on Local Computer Networks (2000), 208–212]. The study of the parameters of the system is based on a connection with a special type of symmetric equations over finite fields. We present two different attacks against the system, whose efficiency depends on the choice of the parameters. In particular, a time-memory tradeoff attack is described, effective when a parameter of the scheme is chosen without care. In such a situation, more than one third of the cases can be broken with a time and space complexity in the range of the square root of the complexity of the best attack suggested by Wu et al. against their system. This leads to a feasible attack in a realistic scenario.https://doi.org/10.1515/jmc-2012-0005finite fieldstime-memory tradeoff attacksystem of power equations |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Maze Gérard |
spellingShingle |
Maze Gérard Analysis of a key distribution scheme in secure multicasting Journal of Mathematical Cryptology finite fields time-memory tradeoff attack system of power equations |
author_facet |
Maze Gérard |
author_sort |
Maze Gérard |
title |
Analysis of a key distribution scheme in secure multicasting |
title_short |
Analysis of a key distribution scheme in secure multicasting |
title_full |
Analysis of a key distribution scheme in secure multicasting |
title_fullStr |
Analysis of a key distribution scheme in secure multicasting |
title_full_unstemmed |
Analysis of a key distribution scheme in secure multicasting |
title_sort |
analysis of a key distribution scheme in secure multicasting |
publisher |
De Gruyter |
series |
Journal of Mathematical Cryptology |
issn |
1862-2976 1862-2984 |
publishDate |
2012-06-01 |
description |
This article presents an analysis of the secure key broadcasting
scheme proposed by Wu, Ruan, Lai and Tseng [Proceedings of the 25th Annual IEEE Conference on Local Computer Networks (2000), 208–212]. The study of
the parameters of the system is based on a connection with a special
type of symmetric equations over finite fields. We present two
different attacks against the system, whose efficiency depends on
the choice of the parameters. In particular, a time-memory tradeoff
attack is described, effective when a parameter of the scheme is
chosen without care. In such a situation, more than one third of the
cases can be broken with a time and space complexity in the range of
the square root of the complexity of the best attack suggested by Wu
et al. against their system. This leads to a feasible attack in a
realistic scenario. |
topic |
finite fields time-memory tradeoff attack system of power equations |
url |
https://doi.org/10.1515/jmc-2012-0005 |
work_keys_str_mv |
AT mazegerard analysisofakeydistributionschemeinsecuremulticasting |
_version_ |
1717767969300283392 |