James Lee Massey


Ontology type: schema:Person     


Person Info

NAME

James Lee

SURNAME

Massey

Publications in SciGraph latest 50 shown

  • 1998 Codes and Ciphers: Fourier and Blahut in CODES, CURVES, AND SIGNALS
  • 1996 Linear Complexity of Periodic Sequences: A General Theory in ADVANCES IN CRYPTOLOGY — CRYPTO ’96
  • 1994 Leaf-Average Node-Sum Interchanges in Rooted Trees with Applications in COMMUNICATIONS AND CRYPTOGRAPHY
  • 1994 A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences in ADVANCES IN CRYPTOLOGY — CRYPTO ’94
  • 1993-03 Cascade ciphers: The importance of being first in JOURNAL OF CRYPTOLOGY
  • 1993 The probability Distribution of the Diffie-Hellman Key in ADVANCES IN CRYPTOLOGY — AUSCRYPT '92
  • 1993 Hash Functions Based on Block Ciphers in ADVANCES IN CRYPTOLOGY — EUROCRYPT’ 92
  • 1993 Welch’s Bound and Sequence Sets for Code-Division Multiple-Access Systems in SEQUENCES II
  • 1992 Deep-space communications and coding: A marriage made in heaven in ADVANCED METHODS FOR SATELLITE AND DEEP SPACE COMMUNICATIONS
  • 1991-01 Local randomness in pseudorandom sequences in JOURNAL OF CRYPTOLOGY
  • 1991 Markov Ciphers and Differential Cryptanalysis in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’91
  • 1991 A Proposal for a New Block Encryption Standard in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’90
  • 1990 An Information-Theoretic Treatment of Homophonic Substitution in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’89
  • 1990 Perfect Local Randomness in Pseudo-random Sequences in ADVANCES IN CRYPTOLOGY — CRYPTO’ 89 PROCEEDINGS
  • 1988 Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’87
  • 1988 Linear complexity in coding theory in CODING THEORY AND APPLICATIONS
  • 1985 Linear Ciphers and Random Sequence Generators with Multiple Clocks in ADVANCES IN CRYPTOLOGY
  • 1983 Fast Authentication in a Trapdoor-Knapsack Public Key Cryptosystem in CRYPTOGRAPHY
  • Affiliations

  • ETH Zurich (current)
  • 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", 
        "affiliation": [
          {
            "affiliation": {
              "id": "http://www.grid.ac/institutes/grid.5801.c", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Massey", 
        "givenName": "James Lee", 
        "id": "sg:person.01034572767.77", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01034572767.77"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-01-01T19:56", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/person/person_677.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.01034572767.77'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...