### Abstract

The encryption process of LUC Cryptosystem is V_{e}(P,l)(mod N), while the decryption process is V_{d}(C,l)(mod N). An N is a product of two relatively primes p and q, P is a message and C is the ciphertext. To compute V_{e} and V_{d}, this system used Lucas Function. The Lucas Functions is a special form of second order linear recurrence relation using a large public integer. Recently, methods for fast LUC Cryptosystem computation in sequential and parallel techniques have been developed. We are introducing an important property of Lucas Function, V_{2n+1}=PV _{2n}-QV_{2n-1}. This property could increase the performance of LUC Cryptosystem computation and reduce the computation time. We are implementing the method in parallel on distributed memory multiprocessor machine using message passing interface. In order to show a new parallel solution is better than the previous parallel solution; we will compare the simulation time, speedup and efficiency of both solutions.

Original language | English |
---|---|

Title of host publication | Proc. 9th ACIS Int. Conf. Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2008 and 2nd Int. Workshop on Advanced Internet Technology and Applications |

Pages | 726-731 |

Number of pages | 6 |

DOIs | |

Publication status | Published - 2008 |

Event | 9th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2008 in conjunction with 2nd International Workshop on Advanced Internet Technology and Applications, AITA 2008 - Phuket Duration: 6 Aug 2008 → 8 Aug 2008 |

### Other

Other | 9th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2008 in conjunction with 2nd International Workshop on Advanced Internet Technology and Applications, AITA 2008 |
---|---|

City | Phuket |

Period | 6/8/08 → 8/8/08 |

### Fingerprint

### ASJC Scopus subject areas

- Artificial Intelligence
- Computer Networks and Communications
- Computer Science Applications

### Cite this

*Proc. 9th ACIS Int. Conf. Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2008 and 2nd Int. Workshop on Advanced Internet Technology and Applications*(pp. 726-731). [4617458] https://doi.org/10.1109/SNPD.2008.19

**Implementation of parallel algorithms for LUC Cryptosystem.** / Md. Ali, Zulkarnain; Othman, Mohamed; Said, Mohd Rushdan Mohd; Sulaiman, Mohammad Nasir.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proc. 9th ACIS Int. Conf. Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2008 and 2nd Int. Workshop on Advanced Internet Technology and Applications.*, 4617458, pp. 726-731, 9th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2008 in conjunction with 2nd International Workshop on Advanced Internet Technology and Applications, AITA 2008, Phuket, 6/8/08. https://doi.org/10.1109/SNPD.2008.19

}

TY - GEN

T1 - Implementation of parallel algorithms for LUC Cryptosystem

AU - Md. Ali, Zulkarnain

AU - Othman, Mohamed

AU - Said, Mohd Rushdan Mohd

AU - Sulaiman, Mohammad Nasir

PY - 2008

Y1 - 2008

N2 - The encryption process of LUC Cryptosystem is Ve(P,l)(mod N), while the decryption process is Vd(C,l)(mod N). An N is a product of two relatively primes p and q, P is a message and C is the ciphertext. To compute Ve and Vd, this system used Lucas Function. The Lucas Functions is a special form of second order linear recurrence relation using a large public integer. Recently, methods for fast LUC Cryptosystem computation in sequential and parallel techniques have been developed. We are introducing an important property of Lucas Function, V2n+1=PV 2n-QV2n-1. This property could increase the performance of LUC Cryptosystem computation and reduce the computation time. We are implementing the method in parallel on distributed memory multiprocessor machine using message passing interface. In order to show a new parallel solution is better than the previous parallel solution; we will compare the simulation time, speedup and efficiency of both solutions.

AB - The encryption process of LUC Cryptosystem is Ve(P,l)(mod N), while the decryption process is Vd(C,l)(mod N). An N is a product of two relatively primes p and q, P is a message and C is the ciphertext. To compute Ve and Vd, this system used Lucas Function. The Lucas Functions is a special form of second order linear recurrence relation using a large public integer. Recently, methods for fast LUC Cryptosystem computation in sequential and parallel techniques have been developed. We are introducing an important property of Lucas Function, V2n+1=PV 2n-QV2n-1. This property could increase the performance of LUC Cryptosystem computation and reduce the computation time. We are implementing the method in parallel on distributed memory multiprocessor machine using message passing interface. In order to show a new parallel solution is better than the previous parallel solution; we will compare the simulation time, speedup and efficiency of both solutions.

UR - http://www.scopus.com/inward/record.url?scp=57749168856&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=57749168856&partnerID=8YFLogxK

U2 - 10.1109/SNPD.2008.19

DO - 10.1109/SNPD.2008.19

M3 - Conference contribution

AN - SCOPUS:57749168856

SN - 9780769532639

SP - 726

EP - 731

BT - Proc. 9th ACIS Int. Conf. Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2008 and 2nd Int. Workshop on Advanced Internet Technology and Applications

ER -