Short RSA keys and their generation View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

1995-03

AUTHORS

Scott A. Vanstone, Robert J. Zuccherato

ABSTRACT

This paper deals with the problem of generating RSA moduli having a predetermined set of bits. It would appear to be of practical interest if one could construct their modulus so that, for example, some of the bits are the ASCII representation of their identification information (i.e., name, address, etc.). This could lead to a savings in both bandwidth for data transmission and storage. A theoretical question which arises in connection with this is to determine the maximum number of bits which can be specified so that the modulus can be determined in polynomial time and, of course, security is maintained. More... »

PAGES

101-114

References to SciGraph publications

  • 1993. Factoring with an Oracle in ADVANCES IN CRYPTOLOGY — EUROCRYPT’ 92
  • 1986-01-01. Efficient Factoring Based on Partial Information in ADVANCES IN CRYPTOLOGY — EUROCRYPT’ 85
  • 1993. A Course in Computational Algebraic Number Theory in NONE
  • 1986. Primality and Cryptography in NONE
  • 1993. Public-Key Cryptosystems with Very Small Key Lengths in ADVANCES IN CRYPTOLOGY — EUROCRYPT’ 92
  • 1989. Factorization and Primality Testing in NONE
  • 1988-01. The generation of random numbers that are probably prime in JOURNAL OF CRYPTOLOGY
  • 1993-09. Elliptic curve cryptosystems and their implementation in JOURNAL OF CRYPTOLOGY
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/bf00190758

    DOI

    http://dx.doi.org/10.1007/bf00190758

    DIMENSIONS

    https://app.dimensions.ai/details/publication/pub.1041529605


    Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
    Incoming Citations Browse incoming citations for this publication using opencitations.net

    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", 
        "about": [
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information and Computing Sciences", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0804", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Data Format", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada", 
              "id": "http://www.grid.ac/institutes/grid.46078.3d", 
              "name": [
                "Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Vanstone", 
            "givenName": "Scott A.", 
            "id": "sg:person.010344544767.07", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010344544767.07"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada", 
              "id": "http://www.grid.ac/institutes/grid.46078.3d", 
              "name": [
                "Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Zuccherato", 
            "givenName": "Robert J.", 
            "id": "sg:person.014530463327.84", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014530463327.84"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/3-540-47555-9_14", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1030622134", 
              "https://doi.org/10.1007/3-540-47555-9_14"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-1-4612-4544-5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025038061", 
              "https://doi.org/10.1007/978-1-4612-4544-5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-322-96647-6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1000591941", 
              "https://doi.org/10.1007/978-3-322-96647-6"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-39805-8_3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1050077263", 
              "https://doi.org/10.1007/3-540-39805-8_3"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-47555-9_35", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025862369", 
              "https://doi.org/10.1007/3-540-47555-9_35"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-662-02945-9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1008271201", 
              "https://doi.org/10.1007/978-3-662-02945-9"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf00203817", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046570674", 
              "https://doi.org/10.1007/bf00203817"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf00206325", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1052533286", 
              "https://doi.org/10.1007/bf00206325"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "1995-03", 
        "datePublishedReg": "1995-03-01", 
        "description": "This paper deals with the problem of generating RSA moduli having a predetermined set of bits. It would appear to be of practical interest if one could construct their modulus so that, for example, some of the bits are the ASCII representation of their identification information (i.e., name, address, etc.). This could lead to a savings in both bandwidth for data transmission and storage. A theoretical question which arises in connection with this is to determine the maximum number of bits which can be specified so that the modulus can be determined in polynomial time and, of course, security is maintained.", 
        "genre": "article", 
        "id": "sg:pub.10.1007/bf00190758", 
        "isAccessibleForFree": true, 
        "isPartOf": [
          {
            "id": "sg:journal.1136278", 
            "issn": [
              "0933-2790", 
              "1432-1378"
            ], 
            "name": "Journal of Cryptology", 
            "publisher": "Springer Nature", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "2", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "8"
          }
        ], 
        "keywords": [
          "ASCII representation", 
          "RSA keys", 
          "data transmission", 
          "set of bits", 
          "identification information", 
          "polynomial time", 
          "RSA modulus", 
          "bits", 
          "security", 
          "maximum number", 
          "practical interest", 
          "representation", 
          "key", 
          "information", 
          "bandwidth", 
          "set", 
          "savings", 
          "transmission", 
          "storage", 
          "example", 
          "theoretical questions", 
          "connection", 
          "generation", 
          "interest", 
          "number", 
          "time", 
          "questions", 
          "course", 
          "modulus", 
          "paper", 
          "problem"
        ], 
        "name": "Short RSA keys and their generation", 
        "pagination": "101-114", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1041529605"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/bf00190758"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/bf00190758", 
          "https://app.dimensions.ai/details/publication/pub.1041529605"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2022-09-02T15:48", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220902/entities/gbq_results/article/article_290.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://doi.org/10.1007/bf00190758"
      }
    ]
     

    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/pub.10.1007/bf00190758'

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

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/bf00190758'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/bf00190758'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/bf00190758'


     

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

    127 TRIPLES      21 PREDICATES      64 URIs      48 LITERALS      6 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/bf00190758 schema:about anzsrc-for:08
    2 anzsrc-for:0804
    3 schema:author N46fdbc0948e44e4391e5f6cdf4a134c9
    4 schema:citation sg:pub.10.1007/3-540-39805-8_3
    5 sg:pub.10.1007/3-540-47555-9_14
    6 sg:pub.10.1007/3-540-47555-9_35
    7 sg:pub.10.1007/978-1-4612-4544-5
    8 sg:pub.10.1007/978-3-322-96647-6
    9 sg:pub.10.1007/978-3-662-02945-9
    10 sg:pub.10.1007/bf00203817
    11 sg:pub.10.1007/bf00206325
    12 schema:datePublished 1995-03
    13 schema:datePublishedReg 1995-03-01
    14 schema:description This paper deals with the problem of generating RSA moduli having a predetermined set of bits. It would appear to be of practical interest if one could construct their modulus so that, for example, some of the bits are the ASCII representation of their identification information (i.e., name, address, etc.). This could lead to a savings in both bandwidth for data transmission and storage. A theoretical question which arises in connection with this is to determine the maximum number of bits which can be specified so that the modulus can be determined in polynomial time and, of course, security is maintained.
    15 schema:genre article
    16 schema:isAccessibleForFree true
    17 schema:isPartOf N2e102e9ce3254bdb84159dec73d286a0
    18 N59b0d46766bd493fb2d5fbdd375707ae
    19 sg:journal.1136278
    20 schema:keywords ASCII representation
    21 RSA keys
    22 RSA modulus
    23 bandwidth
    24 bits
    25 connection
    26 course
    27 data transmission
    28 example
    29 generation
    30 identification information
    31 information
    32 interest
    33 key
    34 maximum number
    35 modulus
    36 number
    37 paper
    38 polynomial time
    39 practical interest
    40 problem
    41 questions
    42 representation
    43 savings
    44 security
    45 set
    46 set of bits
    47 storage
    48 theoretical questions
    49 time
    50 transmission
    51 schema:name Short RSA keys and their generation
    52 schema:pagination 101-114
    53 schema:productId N3aef6533dfc341f7ae163638eff8c3db
    54 N906616024c7240068342df75d698658c
    55 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041529605
    56 https://doi.org/10.1007/bf00190758
    57 schema:sdDatePublished 2022-09-02T15:48
    58 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    59 schema:sdPublisher N9ff1d7d5536b426e81c3e8a4c4b0a4d6
    60 schema:url https://doi.org/10.1007/bf00190758
    61 sgo:license sg:explorer/license/
    62 sgo:sdDataset articles
    63 rdf:type schema:ScholarlyArticle
    64 N2e102e9ce3254bdb84159dec73d286a0 schema:volumeNumber 8
    65 rdf:type schema:PublicationVolume
    66 N3aef6533dfc341f7ae163638eff8c3db schema:name doi
    67 schema:value 10.1007/bf00190758
    68 rdf:type schema:PropertyValue
    69 N46fdbc0948e44e4391e5f6cdf4a134c9 rdf:first sg:person.010344544767.07
    70 rdf:rest N5019331ef3a948d28d47e918a8f06364
    71 N5019331ef3a948d28d47e918a8f06364 rdf:first sg:person.014530463327.84
    72 rdf:rest rdf:nil
    73 N59b0d46766bd493fb2d5fbdd375707ae schema:issueNumber 2
    74 rdf:type schema:PublicationIssue
    75 N906616024c7240068342df75d698658c schema:name dimensions_id
    76 schema:value pub.1041529605
    77 rdf:type schema:PropertyValue
    78 N9ff1d7d5536b426e81c3e8a4c4b0a4d6 schema:name Springer Nature - SN SciGraph project
    79 rdf:type schema:Organization
    80 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    81 schema:name Information and Computing Sciences
    82 rdf:type schema:DefinedTerm
    83 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
    84 schema:name Data Format
    85 rdf:type schema:DefinedTerm
    86 sg:journal.1136278 schema:issn 0933-2790
    87 1432-1378
    88 schema:name Journal of Cryptology
    89 schema:publisher Springer Nature
    90 rdf:type schema:Periodical
    91 sg:person.010344544767.07 schema:affiliation grid-institutes:grid.46078.3d
    92 schema:familyName Vanstone
    93 schema:givenName Scott A.
    94 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010344544767.07
    95 rdf:type schema:Person
    96 sg:person.014530463327.84 schema:affiliation grid-institutes:grid.46078.3d
    97 schema:familyName Zuccherato
    98 schema:givenName Robert J.
    99 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014530463327.84
    100 rdf:type schema:Person
    101 sg:pub.10.1007/3-540-39805-8_3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1050077263
    102 https://doi.org/10.1007/3-540-39805-8_3
    103 rdf:type schema:CreativeWork
    104 sg:pub.10.1007/3-540-47555-9_14 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030622134
    105 https://doi.org/10.1007/3-540-47555-9_14
    106 rdf:type schema:CreativeWork
    107 sg:pub.10.1007/3-540-47555-9_35 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025862369
    108 https://doi.org/10.1007/3-540-47555-9_35
    109 rdf:type schema:CreativeWork
    110 sg:pub.10.1007/978-1-4612-4544-5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025038061
    111 https://doi.org/10.1007/978-1-4612-4544-5
    112 rdf:type schema:CreativeWork
    113 sg:pub.10.1007/978-3-322-96647-6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1000591941
    114 https://doi.org/10.1007/978-3-322-96647-6
    115 rdf:type schema:CreativeWork
    116 sg:pub.10.1007/978-3-662-02945-9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008271201
    117 https://doi.org/10.1007/978-3-662-02945-9
    118 rdf:type schema:CreativeWork
    119 sg:pub.10.1007/bf00203817 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046570674
    120 https://doi.org/10.1007/bf00203817
    121 rdf:type schema:CreativeWork
    122 sg:pub.10.1007/bf00206325 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052533286
    123 https://doi.org/10.1007/bf00206325
    124 rdf:type schema:CreativeWork
    125 grid-institutes:grid.46078.3d schema:alternateName Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
    126 schema:name Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
    127 rdf:type schema:Organization
     




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


    ...