#TITLE_ALTERNATIVE#
ABSTRACT: <br /> <br /> <br /> <br /> <br /> Secret sharing scheme is a method used to secure a secret by sharing or distributing the secret to some participants. To increase the security, a secret showed in a coloring pattern of a graph is encrypted. The encryptio...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/6032 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:6032 |
|---|---|
| spelling |
id-itb.:60322017-09-27T11:43:02Z#TITLE_ALTERNATIVE# Mega Rahmadani (NIM 10103036), Efo Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/6032 ABSTRACT: <br /> <br /> <br /> <br /> <br /> Secret sharing scheme is a method used to secure a secret by sharing or distributing the secret to some participants. To increase the security, a secret showed in a coloring pattern of a graph is encrypted. The encryption process is based on a system of public key cryptography. In this case, the graph structure is a public key, while proper n-coloring of the graph is a private key. The graph n-coloring problem is a special case of public key cryptography Polly Cracker, that known as a NP-complete problem. So that, this scheme is expected to have a good security level, thus it will be difficult enough to attack. text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
ABSTRACT: <br />
<br />
<br />
<br />
<br />
Secret sharing scheme is a method used to secure a secret by sharing or distributing the secret to some participants. To increase the security, a secret showed in a coloring pattern of a graph is encrypted. The encryption process is based on a system of public key cryptography. In this case, the graph structure is a public key, while proper n-coloring of the graph is a private key. The graph n-coloring problem is a special case of public key cryptography Polly Cracker, that known as a NP-complete problem. So that, this scheme is expected to have a good security level, thus it will be difficult enough to attack. |
| format |
Final Project |
| author |
Mega Rahmadani (NIM 10103036), Efo |
| spellingShingle |
Mega Rahmadani (NIM 10103036), Efo #TITLE_ALTERNATIVE# |
| author_facet |
Mega Rahmadani (NIM 10103036), Efo |
| author_sort |
Mega Rahmadani (NIM 10103036), Efo |
| title |
#TITLE_ALTERNATIVE# |
| title_short |
#TITLE_ALTERNATIVE# |
| title_full |
#TITLE_ALTERNATIVE# |
| title_fullStr |
#TITLE_ALTERNATIVE# |
| title_full_unstemmed |
#TITLE_ALTERNATIVE# |
| title_sort |
#title_alternative# |
| url |
https://digilib.itb.ac.id/gdl/view/6032 |
| _version_ |
1820663803434500096 |