Effective compression maps for torus-based cryptography

被引:0
|
作者
Andrea Montanari
机构
来源
关键词
Discrete logarithm problem (DLP); Algebraic tori; Birational maps; Hermitian curves; Singer arc; CEILIDH ; XTR; Pairing-based cryptography; 94A60; 14G50; 14E05;
D O I
暂无
中图分类号
学科分类号
摘要
We give explicit parametrizations of the algebraic tori Tn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {T}_{n}$$\end{document} over any finite field Fq\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {F}_{q}$$\end{document} for any prime power n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n$$\end{document}. Applying the construction for n=3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n=3$$\end{document} to a quadratic field Fq2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {F}_{q^2}$$\end{document} we show that the set of Fq\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {F}_q$$\end{document}-rational points of the torus T6\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {T}_{6}$$\end{document} is birationally equivalent to the affine part of a Singer arc in P2(Fq2)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {P}^2(\mathbb {F}_{q^2})$$\end{document}. This gives a simple, yet efficient compression and decompression algorithm from T6(Fq)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {T}_{6}(\mathbb {F}_{q})$$\end{document} to A2(Fq)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {A}^2(\mathbb {F}_{q})$$\end{document} that can be substituted in the faster implementation of CEILIDH (Granger et al., in Algorithmic number theory, pp 235–249, Springer, Berlin, 2004) achieving a theoretical 30 % speedup and that is also cheaper than the recently proposed factor-6\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$6$$\end{document} compression technique in Karabina (IEEE Trans Inf Theory 58(5):3293–3304, 2012). The compression methods here presented have a wide class of applications to public-key and pairing-based cryptography over any finite field.
引用
收藏
页码:1 / 17
页数:16
相关论文
共 50 条
  • [1] Effective compression maps for torus-based cryptography
    Montanari, Andrea
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2016, 79 (01) : 1 - 17
  • [2] Compression in finite fields and torus-based cryptography
    Rubin, K.
    Silverberg, A.
    [J]. SIAM JOURNAL ON COMPUTING, 2008, 37 (05) : 1401 - 1428
  • [3] Torus-based cryptography
    Rubin, K
    Silverberg, A
    [J]. ADVANCES IN CRYPTOLOGY-CRYPTO 2003, PROCEEDINGS, 2003, 2729 : 349 - 365
  • [4] Normal Elliptic Bases and Torus-Based Cryptography
    Dunand, Clement
    Lercier, Reynald
    [J]. FINITE FIELDS: THEORY AND APPLICATIONS, 2010, 518 : 137 - 153
  • [5] Asymptotically optimal communication for torus-based cryptography
    van Dijk, M
    Woodruff, D
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2004, PROCEEDINGS, 2004, 3152 : 157 - 178
  • [6] Torus-Based Compression by Factor 4 and 6
    Karabina, Koray
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (05) : 3293 - 3304
  • [7] Resource placement in torus-based networks
    IBM Corp, Poughkeepsie, United States
    [J]. IEEE Trans Comput, (1083-1092):
  • [8] Resource placement in torus-based networks
    Bae, MM
    Bose, B
    [J]. 10TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM - PROCEEDINGS OF IPPS '96, 1996, : 327 - 331
  • [9] Resource placement in torus-based networks
    Bae, MM
    Bose, B
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1997, 46 (10) : 1083 - 1092
  • [10] Generating Parameters for Algebraic Torus-Based Cryptosystems
    Yonemura, Tomoko
    Hanatani, Yoshikazu
    Isogai, Taichi
    Ohkuma, Kenji
    Muratani, Hirofumi
    [J]. CRYPTOLOGY AND NETWORK SECURITY, 2010, 6467 : 156 - 168