## Abstract

This paper proposes a method for generating an irreducible polynomial of an arbitrary degree m over an arbitrary prime field double struck F sign _{p} such that p > m. The proposed method is closely related to the minimal polynomial determination and therefore it has the following features: its complexity has little dependency on the size of characteristic p, its calculation cost is explicitly given with degree m, and it can generate primitive polynomials when p^{m} - 1 is factorized as the product of prime numbers. The restriction p > m comes from using Newton's formula.

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

Title of host publication | Proceedings - 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008 |

Pages | 478-485 |

Number of pages | 8 |

DOIs | |

Publication status | Published - Dec 31 2008 |

Event | 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008 - Busan, Korea, Republic of Duration: Nov 11 2008 → Nov 13 2008 |

### Publication series

Name | Proceedings - 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008 |
---|---|

Volume | 2 |

### Other

Other | 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008 |
---|---|

Country/Territory | Korea, Republic of |

City | Busan |

Period | 11/11/08 → 11/13/08 |

## ASJC Scopus subject areas

- Information Systems
- Software

## Fingerprint

Dive into the research topics of 'Systematic generation of an irreducible polynomial of an arbitrary degree m over double struck F sign_{p}such That p > m'. Together they form a unique fingerprint.