Development

Examples:

General / Encryption

» HASH 01: MD5

Last edition: Jan 10th, 2017 |

This example shows how to calculate MD5 message digest to provide INTEGRITY to the sending of information. Both data must be sent over the network: MESSAGE + HASH_MESSAGE

» HASH 02: SHA-1

Last edition: Jan 10th, 2017 |

This example shows how to calculate SHA-1 message digest to provide INTEGRITY to the sending of information. Both data must be sent over the network: MESSAGE + HASH_MESSAGE

» HASH 03: SHA-224

Last edition: Jan 10th, 2017 |

This example shows how to calculate SHA-224 message digest to provide INTEGRITY to the sending of information. Both data must be sent over the network: MESSAGE + HASH_MESSAGE

» HASH 04: SHA-256

Last edition: Jan 10th, 2017 |

This example shows how to calculate SHA-256 message digest to provide INTEGRITY to the sending of information. Both data must be sent over the network: MESSAGE + HASH_MESSAGE

» HASH 05: SHA-384

Last edition: Jan 10th, 2017 |

This example shows how to calculate SHA-384 message digest to provide INTEGRITY to the sending of information. Both data must be sent over the network: MESSAGE + HASH_MESSAGE

» RSA 01: RSA Encryption

Last edition: Jan 10th, 2017 |

This example calculates an encrypted message using the RSA algorithm. For encryption, only the public key is needed. The public key is determined by the modulus and the exponent. The "public key" is (n,e). Where 'n' is the modulus and 'e' is the exponent of the public key.

» RSA 03: RSA Encryption Frame

Last edition: Jan 10th, 2017 |

This example calculates an encrypted message using the RSA algorithm. For encryption, only the public key is needed. The public key is determined by the modulus and the exponent. The "public key" is (n,e). Where 'n' is the modulus and 'e' is the exponent of the public key