. "unstable" . "unstable" . "\n The exponent used to encrypt the message. Number chosen between\n 1 and the totient(p*q). Often named 'e' .\n "@en . "\n It turns out that this relation is unintuitive to write out and to name.\n One should instead use cert:key\n "@en . "Public Key" . "unstable" . . "PGPCertificate" . "RSA Public Key"@en . . "Ontology for Certificates and crypto stuff." . . "Certificate"@en . . . "relates an agent to a key - most often the public key."@en . . . "unstable" . . "\n The union of the public and private components of an RSAKey.\n Usually those pieces are not kept together\n "@en . . . . "Private Key"@en . "unstable" . "unstable" . "private"@en . "exponent"@en . . . . . "PublicKey" . "modulus"@en . . "unstable" . . . . . . . "Signature" . "\n Ontology for Certificates and crypto stuff.\n This is in development. \n Some other ontologies to look at:\n * http://www.w3.org/2000/10/swap/crypto\n + has cwm builtins: http://www.w3.org/2000/10/swap/doc/Trust\n - a bit old perhaps. It imports daml+oil\n - would help to be more completely specified\n - uses literals as subjects a little liberally, which makes this a \n bit difficult to work with frameworks that don't permit this\n * http://xmlns.com/wot/0.1/\n - limited very much to PGP (though on can map PGP to X509)\n - a little coarse grained, mixes up the PGP certificate with the PGP\n public key\n *\n Todo: \n - add some classes and relations for DSA\n - should this all be in one file? Or should this be cut up a little? Say one file for the general CERT ontology, and then files for RSA, DSA, PGP, etc... Or perhaps it does not really matter?\n - expand more on the certification side of things\n - verify this by security experts\n - owl2 has some constructs for combined inverse functional properties. \n This may be useful to use in defining an RSA key which is identified\n by two numbers.\n - also create html version of the spec by using this as a template.\n - should comments such as this be in html?\n "@en . . . . . . . . . "X509Certificate" . . "hexadecimal"@en . . "unstable" . . . . "the class of PGP Certificates"@en . "\n The exponent used to decrypt the message\n calculated as \n public_exponent*private_exponent = 1 modulo totient(p*q)\n The private exponent is often named 'd'\n "@en . . . . "

\n This relation should slowly be transited to just being a datatype.

\n

Being a datatype and a property is legal as explained here\n on the semantic web mailing list in March 2010. \n But it may be somewhat confusing, especially if it goes against a pattern - still to be set - by the xsd datatypes as the follow up email makes clear.

\n "@en . . "the class of X509 Certificates"@en . . "A certificate is a Document that is signed.\n As explained here http://www.pgpi.org/doc/pgpintro/#p16\n 'A digital certificate consists of three things:\n * A public key.\n * Certificate information. ('Identity' information about the \n user, such as name, user ID, and so on.)\n * One or more digital signatures.'\n "@en . . . . "\n The RSA public key. Padded message m are encrypted by applying the function\n modulus(power(m,exponent),modulus)\n "@en . . "RSA Key"@en . . "\n the identity of the public key. This is the entity that knows the private key and \n so can decrypt messages encrypted with the public key, or encrypt messages that can \n be decrypted with the public key. \n "@en . " \n

The modulus of an RSA public and private key. \n Or the modulus of a DSA Key.\n The modulus is encoded as a hex binary. The binary is the same as the one encoded in the \n XML DSIG CryptoBinary\n

\n
\n This specification defines the ds:CryptoBinary simple type for representing arbitrary-length integers (e.g. \"bignums\") in XML as octet strings. The integer value is first converted to a \"big endian\" bitstring. The bitstring is then padded with leading zero bits so that the total number of bits == 0 mod 8 (so that there are an integral number of octets). If the bitstring contains entire leading octets that are zero, these are removed (so the high-order octet is always non-zero).\n
\n

The only difference is that the octet string is then encoded using either xsd:base64Binary or xsd:hexBinary. Currently for all usages of this relation, the xsd:hexBinary datatype should be used until the SPARQL working group specifies specifies in its D-Entailment that those two types are equivalent.

\n

It would have been better had there been a hexInteger datatype that was standard and supported by all tools.

\n "@en . "the class of signtatures"@en . "2008-11-13"^^ . . . . . . "the class of keys"@en . "archaic" . . "PrivateKey" . . "unstable" . . . . . "unstable" . "archaic" . . "identity"@en . . "unstable" . "unstable" . . . . . "unstable" . . "key"@en . "

\n An encoding of a positive integer (from 0 to infinity) as a hexadecimal string that makes it easy to read and/or fun to present on the web.

\n

The purpose of this way of representing hexadecimals is to enable users to copy and paste hexadecimal notations as shown by most browsers, keychains or tools such as opensso, into their rdf representation of choice. There are a wide variety of ways in which such strings can be presented. One finds the following:

\n
\n  e1 dc d5 e1 00 8f 21 5e d5 cc 7c 7e c4 9c ad 86 \n  64 aa dc 29 f2 8d d9 56 7f 31 b6 bd 1b fd b8 ee \n  51 0d 3c 84 59 a2 45 d2 13 59 2a 14 82 1a 0f 6e \n  d3 d1 4a 2d a9 4c 7e db 90 07 fc f1 8d a3 8e 38 \n  25 21 0a 32 c1 95 31 3c ba 56 cc 17 45 87 e1 eb \n  fd 9f 0f 82 16 67 9f 67 fa 91 e4 0d 55 4e 52 c0 \n  66 64 2f fe 98 8f ae f8 96 21 5e ea 38 9e 5c 4f \n  27 e2 48 ca ca f2 90 23 ad 99 4b cc 38 32 6d bf  \n
\n

\n Or the same as the above, with ':' instead of spaces. We can't guarantee that these are the only ways such tools will present hexadecimals, so we are very lax.

\n

The letters can be uppercase or lowercase, or mixed.

\n

Some strings may start with initial 00's, and can be stripped in this notation as they often are. Doing this could, in complement of 2 notation turn a positive number into a negative one, if the first hexadecimal character happens to be one of the set {'8', '9', 'a', 'A', 'b', 'B', 'c', 'C', 'd', 'D', 'e', 'E', 'f', 'F'} . As we interpret this string as a hexadecimal number leading 00s are not important (Complement of 2 notation and hexadecimal overlap for positive numbers)

\n

In order to make this fun, we allow any unicode characters in the string. A parser should

\n
    \n
  1. remove all non hexadecimal characters
    2. \n
  2. treat the resulting as a hexadecimal representation of a number
    3. \n
\n

\n This will allow people to make an ascii - better yet a UTF-8 - picture of their public key when publishing it on the web.\n

\n

\n Cert hex is also a datatype property because we used to write it out like this\n

\n 
\n   [] a rsa:RSAPublicKey;\n     rsa:public_exponent [ cert:hex \"e1 dc d5 ...\"] \n
\n

The above notation is now deprecated. Now we prefer the literal format below.

\n 
\n   [] a rsa:RSAPublicKey;\n     rsa:public_exponent \"e1 dc d5 ...\"^^cert:hex .\n
\n \n "^^ . .