DELEGATED SIGNCRYPTION CRYPTOGRAPHY WITH DISTRIBUTED PROCESS AND MESSAGE USING MULTI AGENT SYSTEMS

• Main Author: BETA KUNTARDJO KRISTIONO (NIM : 332 04 003); Tim Pembimbing: Prof. Dr. Ir. Bambang Riyanto Tr, Samuel
• Format: Dissertations
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/17144
• Institution: Institut Teknologi Bandung

Signcryption is a new cryptography paradigm that fullfils two functions : digitally signing and encrypting of public key cryptography simultaneously, with less cost than conventional approach (sign-then-encrypt). Neverthless its computational load depends on size of the message. <br /> <br /> The dissertation deals with the problem on how the process of signcryption cryptography can be broken down into smaller tasks and does not depend on message size. <br /> <br /> A new task graph is developped (1) to decompose and group into message sizedependent and independent task units and (2) to cut message into equal blok size, <br /> <br /> so that message size does not play a role. <br /> <br /> Based on its functionality, this research succeded in decomposing signcryption into 7 parts of process with 9 task units and decomposing designcryption into 6 <br /> <br /> parts of process with 10 task units. Every task unit will be delegated and executed by agents within a multi-agent systems (MAS). MAS is designed to have an interface agent and 13 kinds of process. Interface agent accepts all parameters supplied by user and manage those parameters. Finally it distributes task to appropriate agent. Process agent is designed for one time usage and its function is for calculation, message cutting and grouping, checking the completeness and orginality of the message. <br /> <br /> The decomposition of signcryption cryptographic process decreases the maximal computational power required by unit task for around 80% of its normal load, with the value remains constant relative to message size. As this computational power requirement is relatively constant, the percentage of computational power reduction is increasing continuously as the message encrypted is getting bigger. If this decomposed cryptographic signcryption is performed task by task in a node, then the total computational power will exceed 110%. In spite of this increase, there is still an advantage because the value of the unit remains constant. This fact shows that a node whose computational power smaller than the one required by full signcryption process is still capable to perform signcryption process and does not need to increase its computational power to process a bigger message. <br /> <br /> By decomposition, the previous signcryption cryptographic process that must be fulfilled completely in one step in one node can be performed independently or distributively task by task with less computational load.