About: Finding Good Random Elliptic Curves for Cryptosystems Defined Over $GF(2^n)$   Goto Sponge  NotDistinct  Permalink

An Entity of Type : owl:Thing, within Data Space : data.idref.fr associated with source document(s)

AttributesValues
Author
Bibliographic Citation
  • Lercier Reynald. Finding Good Random Elliptic Curves for Cryptosystems Defined Over $GF(2^n)$. EUROCRYPT '97, May 1997, Konstanz, Germany. pp.379-392, ⟨10.1007/3-540-69053-0_26⟩
Title
  • Finding Good Random Elliptic Curves for Cryptosystems Defined Over $GF(2^n)$
dc:date
  • 1997
Digital Object Identifier (DOI)
  • 10.1007/3-540-69053-0_26
Faceted Search & Find service v1.13.91 as of Aug 16 2018


Alternative Linked Data Documents: ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of May 14 2019, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (70 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software