IEICE TRANSACTIONS on Fundamentals
Permutation Network with Arbitrary Number of Inputs and Its Application to Mix-Net
Summary :
An efficient construction of a permutation network has been proposed by Waksman. However, his construction is only for permutation networks with 2k inputs. This paper provides a construction of permutation networks with arbitrary number of inputs that is an extension of Waksman's construction. By applying our construction to Abe's Mix-net, we can improve the efficiency of the Mix-net.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E85-A No.1 pp.194-197
- Publication Date
- 2002/01/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Section on Cryptography and Information Security)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Koutarou SUZUKI, "Permutation Network with Arbitrary Number of Inputs and Its Application to Mix-Net" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 1, pp. 194-197, January 2002, doi: .
Abstract: An efficient construction of a permutation network has been proposed by Waksman. However, his construction is only for permutation networks with 2k inputs. This paper provides a construction of permutation networks with arbitrary number of inputs that is an extension of Waksman's construction. By applying our construction to Abe's Mix-net, we can improve the efficiency of the Mix-net.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_1_194/_p
Copy
@ARTICLE{e85-a_1_194,
author={Koutarou SUZUKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Permutation Network with Arbitrary Number of Inputs and Its Application to Mix-Net},
year={2002},
volume={E85-A},
number={1},
pages={194-197},
abstract={An efficient construction of a permutation network has been proposed by Waksman. However, his construction is only for permutation networks with 2k inputs. This paper provides a construction of permutation networks with arbitrary number of inputs that is an extension of Waksman's construction. By applying our construction to Abe's Mix-net, we can improve the efficiency of the Mix-net.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Permutation Network with Arbitrary Number of Inputs and Its Application to Mix-Net
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 194
EP - 197
AU - Koutarou SUZUKI
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2002
AB - An efficient construction of a permutation network has been proposed by Waksman. However, his construction is only for permutation networks with 2k inputs. This paper provides a construction of permutation networks with arbitrary number of inputs that is an extension of Waksman's construction. By applying our construction to Abe's Mix-net, we can improve the efficiency of the Mix-net.
ER -
English
