Scott A Vanstone


Ontology type: schema:Person     


Person Info

NAME

Scott A

SURNAME

Vanstone

Publications in SciGraph latest 50 shown

  • 2006 Accelerated Verification of ECDSA Signatures in SELECTED AREAS IN CRYPTOGRAPHY
  • 2003-03 An Efficient Protocol for Authenticated Key Agreement in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2002-12-18 Validation of Elliptic Curve Public Keys in PUBLIC KEY CRYPTOGRAPHY — PKC 2003
  • 2002-12-16 Message Authentication Codes with Error Correcting Capabilities in INFORMATION AND COMMUNICATIONS SECURITY
  • 2002-07-31 Provably Secure Implicit Certificate Schemes in FINANCIAL CRYPTOGRAPHY
  • 2002 Cryptanalysis of the Sakazaki-Okamoto-Mambo ID-based Key Distribution System over Elliptic Curves in FINITE FIELDS WITH APPLICATIONS TO CODING THEORY, CRYPTOGRAPHY AND RELATED AREAS
  • 2001-10-26 Postal Revenue Collection in the Digital Age in FINANCIAL CRYPTOGRAPHY
  • 2001-08-02 Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms in ADVANCES IN CRYPTOLOGY — CRYPTO 2001
  • 2000-03 The State of Elliptic Curve Cryptography in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2000 Worst-Case Analysis of an Algorithm for Computing the Greatest Common Divisor of n Inputs in CODING THEORY, CRYPTOGRAPHY AND RELATED AREAS
  • 2000 The State of Elliptic Curve Cryptography in TOWARDS A QUARTER-CENTURY OF PUBLIC KEY CRYPTOGRAPHY
  • 1998-05 Discrete Logarithm Based Cryptosystems in Quadratic Function Fields of Characteristic 2 in DESIGNS, CODES AND CRYPTOGRAPHY
  • 1996-05 Codes Based on Complete Graphs in DESIGNS, CODES AND CRYPTOGRAPHY
  • 1996-05 Codes based on complete graphs in DESIGNS, CODES AND CRYPTOGRAPHY
  • 1996 Codes Based on Complete Graphs in DESIGNS AND FINITE GEOMETRIES
  • 1995-11 An application of coding theory to a problem in graphical enumeration in ARCHIV DER MATHEMATIK
  • 1995-05 Subspaces and polynomial factorizations over finite fields in APPLICABLE ALGEBRA IN ENGINEERING, COMMUNICATION AND COMPUTING
  • 1995-03 Short RSA keys and their generation in JOURNAL OF CRYPTOLOGY
  • 1994-12 Factorizations in the elementary Abelian p-group and their cryptographic significance in JOURNAL OF CRYPTOLOGY
  • 1994 On orders of optimal normal basis generators in ALGORITHMIC NUMBER THEORY
  • 1993-10 Hanani triple systems in ISRAEL JOURNAL OF MATHEMATICS
  • 1993-09 Elliptic curve cryptosystems and their implementation in JOURNAL OF CRYPTOLOGY
  • 1993-03 Arithmetic operations inGF(2m) in JOURNAL OF CRYPTOLOGY
  • 1993 Applications of Finite Fields in NONE
  • 1993 On the Development of a Fast Elliptic Curve Cryptosystem in ADVANCES IN CRYPTOLOGY — EUROCRYPT’ 92
  • 1993 Public-Key Cryptosystems with Very Small Key Lengths in ADVANCES IN CRYPTOLOGY — EUROCRYPT’ 92
  • 1992-03 A note on cyclic groups, finite fields, and the discrete logarithm problem in APPLICABLE ALGEBRA IN ENGINEERING, COMMUNICATION AND COMPUTING
  • 1992 New Public-Key Schemes Based on Elliptic Curves over the Ring Zn in ADVANCES IN CRYPTOLOGY — CRYPTO ’91
  • 1991-03 The existence of non-trivial hyperfactorizations ofK2n in COMBINATORICA
  • 1991-01 An implementation for a fast public-key cryptosystem in JOURNAL OF CRYPTOLOGY
  • 1990 The implementation of elliptic curve cryptosystems in ADVANCES IN CRYPTOLOGY — AUSCRYPT '90
  • 1990 A Fast Elliptic Curve Cryptosystem in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’89
  • 1989-12 On the chromatic index of a finite projective space in GEOMETRIAE DEDICATA
  • 1989 An Introduction to Error Correcting Codes with Applications in NONE
  • 1989 Some computational aspects of root finding in GF(qm) in SYMBOLIC AND ALGEBRAIC COMPUTATION
  • 1988-12 Orthogonal resolutions in odd balanced tournament designs in GRAPHS AND COMBINATORICS
  • 1988 Fast Exponentiation in GF(2n) in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’88
  • 1988 An Interactive Data Exchange Protocol Based on Discrete Exponentiation in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’88
  • 1988 A Combinatorial Approach to Threshold Schemes in ADVANCES IN CRYPTOLOGY — CRYPTO ’87
  • 1988 Complexity Issues for Public Key Cryptography in PERFORMANCE LIMITS IN COMMUNICATION THEORY AND PRACTICE
  • 1987-02 Conical Embeddings of Steiner systems in RENDICONTI DEL CIRCOLO MATEMATICO DI PALERMO SERIES 2
  • 1986-12 Orthogonal packings inPG(5, 2) in AEQUATIONES MATHEMATICAE
  • 1986-12 Elliptic semiplanes and group divisible designs with orthogonal resolutions in AEQUATIONES MATHEMATICAE
  • 1985 Computing Logarithms in GF (2n) in ADVANCES IN CRYPTOLOGY
  • 1984-01 Asymptotic properties of locally extensible designs in GEOMETRIAE DEDICATA
  • 1981-12 Recursive constructions for skew resolutions in affine geometries in AEQUATIONES MATHEMATICAE
  • 1981-09 The existence of howell designs of siden+1 and order 2n in COMBINATORICA
  • 1980 On automorphisms of doubly resolvable designs in COMBINATORIAL MATHEMATICS VII
  • 1978-02 Orthogonal systems in AEQUATIONES MATHEMATICAE
  • JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "familyName": "Vanstone", 
        "givenName": "Scott A", 
        "id": "sg:person.010344544767.07", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010344544767.07"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-08-04T17:38", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220804/entities/gbq_results/person/person_916.jsonl", 
        "type": "Person"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.010344544767.07'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.010344544767.07'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.010344544767.07'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.010344544767.07'


     

    This table displays all metadata directly associated to this object as RDF triples.

    11 TRIPLES      9 PREDICATES      10 URIs      6 LITERALS      1 BLANK NODES

    Subject Predicate Object
    1 sg:person.010344544767.07 schema:familyName Vanstone
    2 schema:givenName Scott A
    3 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010344544767.07
    4 schema:sdDatePublished 2022-08-04T17:38
    5 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    6 schema:sdPublisher N4af428f655cd45fdae157c5992c2fc1e
    7 sgo:license sg:explorer/license/
    8 sgo:sdDataset persons
    9 rdf:type schema:Person
    10 N4af428f655cd45fdae157c5992c2fc1e schema:name Springer Nature - SN SciGraph project
    11 rdf:type schema:Organization
     




    Preview window. Press ESC to close (or click here)


    ...