Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2741406
Jump to:navigation, search

zbMath0987.94507MaRDI QIDQ2741406

A. V. Ourivski, Ernst M. Gabidulin

Publication date: 14 October 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

public key cryptographyrank codesGPT systemright scrambler


Mathematics Subject Classification ID

Cryptography (94A60)


Related Items (5)

Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes ⋮ Improved cryptanalysis of rank metric schemes based on Gabidulin codes ⋮ Asymptotic behaviour of codes in rank metric over finite fields ⋮ New rank codes based encryption scheme using partial circulant matrices ⋮ Rank-Metric Codes and Their Applications


Uses Software

  • McEliece


Cites Work

  • Unnamed Item
  • Theory of codes with maximum rank distance
  • Severely denting the Gabidulin version of the McEliece public key cryptosystem


This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2741406&oldid=15606005"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 14:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki