You are here:   
  1. Home
  2. Persons
  3. http://scigraph.springernature.com/person.015040765627.38

Kazumaro Aoki

Ontology type: schema:Person     


Person Info

NAME

Kazumaro

SURNAME

Aoki

Publications in SciGraph latest 50 shown

  • 2020-01-10 On the Data Limitation of Small-State Stream Ciphers: Correlation Attacks on Fruit-80 and Plantlet in SELECTED AREAS IN CRYPTOGRAPHY – SAC 2019
  • 2018-07-26 (Short Paper) Parameter Trade-Offs for NFS and ECM in ADVANCES IN INFORMATION AND COMPUTER SECURITY
  • 2018-07-24 Fast Correlation Attack Revisited in ADVANCES IN CRYPTOLOGY – CRYPTO 2018
  • 2017-07-27 On Quantum Related-Key Attacks on Iterated Even-Mansour Ciphers in ADVANCES IN INFORMATION AND COMPUTER SECURITY
  • 2016-06-09 Wide Trail Design Strategy for Binary MixColumns in APPLIED CRYPTOGRAPHY AND NETWORK SECURITY
  • 2015-03-17 How Much Can Complexity of Linear Cryptanalysis Be Reduced? in INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2014
  • 2014 Differential and Impossible Differential Related-Key Attacks on Hierocrypt-L1 in INFORMATION SECURITY AND PRIVACY
  • 2014 FFT Key Recovery for Integral Attack in CRYPTOLOGY AND NETWORK SECURITY
  • 2013 An Experiment of Number Field Sieve for Discrete Logarithm Problem over GF(p12) in ‘
  • 2013 Highly Accurate Key Extraction Method for Access-Driven Cache Attacks Using Correlation Coefficient in INFORMATION SECURITY AND PRIVACY
  • 2013 The Security and Performance of “GCM” when Short Multiplications Are Used Instead in INFORMATION SECURITY AND CRYPTOLOGY
  • 2013 The Security of the OCB Mode of Operation without the SPRP Assumption in PROVABLE SECURITY
  • 2012 Byte Slicing Grøstl: Improved Intel AES-NI and Vector-Permute Implementations of the SHA-3 Finalist Grøstl in E-BUSINESS AND TELECOMMUNICATIONS
  • 2012 Improved Integral Analysis on Tweaked Lesamnta in INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2011
  • 2011 Preimage Attacks against PKC98-Hash and HAS-V in INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2010
  • 2010-12-24 A heterogeneous computing environment to solve the 768-bit RSA challenge in CLUSTER COMPUTING
  • 2010 Factorization of a 768-Bit RSA Modulus in ADVANCES IN CRYPTOLOGY – CRYPTO 2010
  • 2009 Meet-in-the-Middle Preimage Attacks on Double-Branch Hash Functions: Application to RIPEMD and Others in INFORMATION SECURITY AND PRIVACY
  • 2009 Finding Preimages in Full MD5 Faster Than Exhaustive Search in ADVANCES IN CRYPTOLOGY - EUROCRYPT 2009
  • 2009 Preimage Attacks on One-Block MD4, 63-Step MD5 and More in SELECTED AREAS IN CRYPTOGRAPHY
  • 2009 Preimages for Step-Reduced SHA-2 in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2009
  • 2009 Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1 in ADVANCES IN CRYPTOLOGY - CRYPTO 2009
  • 2009 A Preimage Attack for 52-Step HAS-160 in INFORMATION SECURITY AND CRYPTOLOGY – ICISC 2008
  • 2008 Preimage Attacks on Step-Reduced MD5 in INFORMATION SECURITY AND PRIVACY
  • 2008 Preimage Attacks on 3, 4, and 5-Pass HAVAL in ADVANCES IN CRYPTOLOGY - ASIACRYPT 2008
  • 2008-01-01 Faster Implementation of ηT Pairing over GF(3m) Using Minimum Number of Logical Instructions for GF(3)-Addition in PAIRING-BASED CRYPTOGRAPHY – PAIRING 2008
  • 2007 A Kilobit Special Number Field Sieve Factorization in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2007
  • 2007-01-01 Experiments on the Linear Algebra Step in the Number Field Sieve in ADVANCES IN INFORMATION AND COMPUTER SECURITY
  • 2006 Compressed Jacobian Coordinates for OEF in PROGRESS IN CRYPTOLOGY - VIETCRYPT 2006
  • 2006 Integer Factoring Utilizing PC Cluster in CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2006
  • 2004 Sieving Using Bucket Sort in ADVANCES IN CRYPTOLOGY - ASIACRYPT 2004
  • 2004 On the Use of GF-Inversion as a Cryptographic Primitive in SELECTED AREAS IN CRYPTOGRAPHY
  • 2001-10-24 A Cyclic Window Algorithm for ECC Defined over Extension Fields in INFORMATION AND COMMUNICATIONS SECURITY
  • 2001-09-11 Elliptic Curve Arithmetic Using SIMD in INFORMATION SECURITY
  • 2001-04-25 Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis in SELECTED AREAS IN CRYPTOGRAPHY
  • 2000 Efficient Evaluation of Security against Generalized Interpolation Attack in SELECTED AREAS IN CRYPTOGRAPHY
  • 2000 Security of E2 against Truncated Differential Cryptanalysis in SELECTED AREAS IN CRYPTOGRAPHY
  • 1999 On Maximum Non-averaged Differential Probability in SELECTED AREAS IN CRYPTOGRAPHY
  • 1999 A Strategy for Constructing Fast Round Functions with Practical Security Against Differential and Linear Cryptanalysis in SELECTED AREAS IN CRYPTOGRAPHY
  • 1997 Best differential characteristic search of FEAL in FAST SOFTWARE ENCRYPTION
  • 1995 Improving the Search Algorithm for the Best Linear Expression in ADVANCES IN CRYPTOLOGY — CRYPT0’ 95

    • Affiliations

  • NTT (Japan) (current)
  • Graz University of Technology

    • 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.419819.c", 
          "type": "Organization"
        }, 
        "isCurrent": true, 
        "type": "OrganizationRole"
      }, 
      {
        "id": "http://www.grid.ac/institutes/grid.410413.3", 
        "type": "Organization"
      }
    ], 
    "familyName": "Aoki", 
    "givenName": "Kazumaro", 
    "id": "sg:person.015040765627.38", 
    "sameAs": [
      "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015040765627.38"
    ], 
    "sdDataset": "persons", 
    "sdDatePublished": "2022-05-20T08:05", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/person/person_806.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.015040765627.38'

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

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

    Turtle is a human-readable linked data format. 

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

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

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


     




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

    ...