Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Applicable Algebra in Engineering, Communication and Computing
Published in: Applicable Algebra in Engineering, Communication and Computing 2/2021

29-11-2019 | Original Paper

A modified Dual-Ouroboros public-key encryption using Gabidulin codes

Authors: Jon-Lark Kim, Young-Sik Kim, Lucky Erap Galvez, Myeong Jae Kim

Published in: Applicable Algebra in Engineering, Communication and Computing | Issue 2/2021

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Dual-Ouroboros (Gaborit et al. in Adv Math Commun, 2019. https://​doi.​org/​10.​3934/​amc.​2020021) is a code-based public-key encryption scheme which is a modification of McNie and a dual version of Ouroboros-R. In this paper, we present a modification of Dual-Ouroboros, using a class of rank metric codes called Gabidulin codes. By using Gabidulin codes, we eliminate the probability of decoding failure, which is one of the limitations of Dual-Ouroboros since it uses LRPC codes with probabilistic decoding. We also prove that our proposed cryptosystem is IND-CPA secure. Suggested parameters are also given which provides lower key sizes compared to other known code-based cryptosystems with zero decryption failure probability.
previous article Parametrization of generalized Heisenberg groups
next article Complexity of deciding whether a tropical linear prevariety is a tropical variety

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now
Literature
1.
2.
Aragon, N., Gaborit, P., Hauteville A., Tillich, J.P.: Improvement of the generic attacks for the rank syndrome decoding problem (2017), \(\langle \text{hal-01608464}\rangle \)
3.
Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in \(2^{n/20}\): how 1 + 1 = 0 improves information set decoding. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 520–536. Springer, Berlin (2012)
4.
Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems (Corresp.). IEEE Trans. Inf. Theory 24(3), 384–386 (1978)CrossRef
5.
Delsarte, P.H.: Bilinear Forms over a finite field, with applications to coding theory. J. Comb. Theory Ser. A 25, 226–241 (1978)MathSciNetCrossRef
6.
Gabidulin, E.M.: Theory of codes with maximum rank distance. Problemy Peredachi Informatsii 21(1), 3–16 (1985)MathSciNetMATH
7.
Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V.: Ideals over a noncommutative ring and their applications to cryptography. In: Proceedings of Eurocrypt, LNCS, vol. 547, pp. 482–489, Springer (1991)
8.
9.
Gaborit, P., Zemor, G.: On the hardness of the decoding and the minimum distance problems for rank codes. IEEE Trans. Inf. Theory 62(12), 7245–7252 (2016)MathSciNetCrossRef
10.
Lau, T.S.C., Tan, C.H.: Key recovery attack on McNie based on low rank parity check codes and its reparation. In: International Workshop on Security, pp. 19–34. Springer, Cham (2018)
11.
12.
Loidreau, P.: A Welch-Berlekamp like algorithm for decoding Gabidulin codes. In: International Workshop on Coding and Cryptography, pp. 36–45. Springer, Berlin (2005)
13.
McEliece, R.J.: A public key cryptosystem based on algebraic coding theory. DSN Prog. Rep. 42–44, 114–116 (1978)
14.
15.
16.
Misoczki, R., Barreto, P.S.: Compact McEliece keys from Goppa codes. In: Selected Areas in Cryptography, pp. 376–392 (2009)
17.
18.
Overbeck, R.: A new structural attack for GPT and variants. In: International Conference on Cryptology in Malaysia, pp. 50–63. Springer, Berlin (2005)
19.
Overbeck, R.: Structural attacks for public key cryptosystems based on Gabidulin codes. J. Cryptol. 21(2), 280–301 (2008)MathSciNetCrossRef
20.
21.
Silva, D., Kschischang, F.R.: Fast encoding and decoding of Gabidulin codes. In: 2009 IEEE International Symposium on Information Theory, pp. 2858–2862. IEEE (2009)
Metadata
Title
A modified Dual-Ouroboros public-key encryption using Gabidulin codes
Authors
Jon-Lark Kim
Young-Sik Kim
Lucky Erap Galvez
Myeong Jae Kim
Publication date
29-11-2019
Publisher
Springer Berlin Heidelberg
Published in
Applicable Algebra in Engineering, Communication and Computing / Issue 2/2021
Print ISSN: 0938-1279
Electronic ISSN: 1432-0622
DOI
https://doi.org/10.1007/s00200-019-00406-x

Other articles of this Issue 2/2021

Applicable Algebra in Engineering, Communication and Computing 2/2021 Go to the issue

Original Paper

On the classification of binary self-dual codes admitting imprimitive rank 3 permutation groups

Original Paper

Parametrization of generalized Heisenberg groups

Original Paper

LCD codes from weighing matrices

Original Paper

On the self-dual codes with an automorphism of order 5

Original Paper

Complexity of deciding whether a tropical linear prevariety is a tropical variety

Premium Partner

    Image Credits