types:Hash leaf node


URI

https://unifiedcyberontology.org/ontology/uco/types#Hash

Label

Hash

Description

A hash is a grouping of characteristics unique to the result of applying a mathematical algorithm that maps data of arbitrary size to a bit string (the 'hash') and is a one-way function, that is, a function which is practically infeasible to invert. This is commonly used for integrity checking of data. [based on https://en.wikipedia.org/wiki/Cryptographic_hash_function]

Target Classes (1)

Shape Properties

Instances of types:Hash can have the following properties:

PROPERTY

MIN COUNT

MAX COUNT

TYPE

types:Hash
types:hashMethod 1 1 vocabulary1:HashNameVocab
types:hashValue 1 1 xsd:hexBinary

Implementation

@prefix owl: <http://www.w3.org/2002/07/owl#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix sh: <http://www.w3.org/ns/shacl#> .
@prefix types: <https://unifiedcyberontology.org/ontology/uco/types#> .
@prefix vocabulary1: <https://unifiedcyberontology.org/ontology/uco/vocabulary#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

types:Hash a owl:Class,
        sh:NodeShape ;
    rdfs:label "Hash"@en ;
    rdfs:comment "A hash is a grouping of characteristics unique to the result of applying a mathematical algorithm that maps data of arbitrary size to a bit string (the 'hash') and is a one-way function, that is, a function which is practically infeasible to invert. This is commonly used for integrity checking of data. [based on https://en.wikipedia.org/wiki/Cryptographic_hash_function]"@en ;
    sh:property [ sh:datatype xsd:hexBinary ;
            sh:maxCount 1 ;
            sh:minCount 1 ;
            sh:nodeKind sh:Literal ;
            sh:path types:hashValue ],
        [ sh:datatype vocabulary1:HashNameVocab ;
            sh:maxCount 1 ;
            sh:minCount 1 ;
            sh:nodeKind sh:Literal ;
            sh:path types:hashMethod ] ;
    sh:targetClass types:Hash .