The Fourth Order Linear Recurrence Sequence For RSA Type Cryptosystem
A cryptosystem is derived from the fourth order linear recurrence relations analogous to the RSA cryptosystem which is based on Lucas sequences. The fourth order linear recurrence sequence is a sequence of integers −1 −2 −3 −4 = − + − n n n n n V PV QV RV SV , where P, Q, R and S are coefficients...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | أطروحة |
| اللغة: | English |
| منشور في: |
2006
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://psasir.upm.edu.my/id/eprint/268/3/549098_ipm_2006_1_abstrak_je__dh_pdf_.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| id |
my-upm-ir.268 |
|---|---|
| record_format |
uketd_dc |
| spelling |
my-upm-ir.2682015-08-06T03:28:43Z The Fourth Order Linear Recurrence Sequence For RSA Type Cryptosystem 2006-02 Wong, Tze Jin A cryptosystem is derived from the fourth order linear recurrence relations analogous to the RSA cryptosystem which is based on Lucas sequences. The fourth order linear recurrence sequence is a sequence of integers −1 −2 −3 −4 = − + − n n n n n V PV QV RV SV , where P, Q, R and S are coefficients in quartic polynomial, 0 4 3 2 x − Px + Qx − Rx + S = .The factorization of the quartic polynomial modulo p can be classified into five major types. We define the cyclic structure for every types. Then, we can generate the Euler totient function from the cyclic structure of every types of the quartic polynomial.We have some properties of the sequence which are straightforward consequences of the definition. Then, we are able to define the composition and inverse of fourth order linear recurrence sequence. From cycles and totient, we know the quartic polynomial can be factorized into five major types, that is t[4], t[3,1], t[2,1], t[2] and t[1]. We sketch an algorithm to compute the type of a quartic polynomial in Fp[x], where p is any prime number. In this quartic cryptosystem, we have two large secret primes p and q, the product N of which is part of the encryption key. The encryption key is (e, N) where e is relatively prime toΦ(N) , which are analogous to Euler-φ function, to cover all possible cases. The decoding key, d is inverse e modulo Φ(N).For quartic cryptosystem, (P,Q,R) constitutes the message, and ( , , ) 1 2 3 C C C constitutes the ciphertext. In decoding, we are given the function ( ) g x = x −C x +C x −C x + but not ( ) 1 4 3 2 f x = x − Px + Qx − Rx + , and so we have to deduce the type of f in order to apply the algorithm correctly Cryptography 2006-02 Thesis http://psasir.upm.edu.my/id/eprint/268/ http://psasir.upm.edu.my/id/eprint/268/3/549098_ipm_2006_1_abstrak_je__dh_pdf_.pdf application/pdf en public masters Universiti Putra Malaysia Cryptography Institute of Mathematical Research |
| institution |
Universiti Putra Malaysia |
| collection |
PSAS Institutional Repository |
| language |
English |
| topic |
Cryptography |
| spellingShingle |
Cryptography Wong, Tze Jin The Fourth Order Linear Recurrence Sequence For RSA Type Cryptosystem |
| description |
A cryptosystem is derived from the fourth order linear recurrence relations
analogous to the RSA cryptosystem which is based on Lucas sequences. The
fourth order linear recurrence sequence is a sequence of integers
−1 −2 −3 −4 = − + − n n n n n V PV QV RV SV , where P, Q, R and S are coefficients in quartic polynomial, 0 4 3 2 x − Px + Qx − Rx + S = .The factorization of the quartic polynomial modulo p can be classified into five
major types. We define the cyclic structure for every types. Then, we can generate the Euler totient function from the cyclic structure of every types of the quartic
polynomial.We have some properties of the sequence which are straightforward consequences
of the definition. Then, we are able to define the composition and inverse of fourth
order linear recurrence sequence.
From cycles and totient, we know the quartic polynomial can be factorized into five
major types, that is t[4], t[3,1], t[2,1], t[2] and t[1]. We sketch an algorithm to
compute the type of a quartic polynomial in Fp[x], where p is any prime number.
In this quartic cryptosystem, we have two large secret primes p and q, the product
N of which is part of the encryption key. The encryption key is (e, N) where e is relatively prime toΦ(N) , which are analogous to Euler-φ function, to cover all possible cases. The decoding key, d is inverse e modulo Φ(N).For quartic cryptosystem, (P,Q,R) constitutes the message, and ( , , ) 1 2 3 C C C
constitutes the ciphertext. In decoding, we are given the function
( ) g x = x −C x +C x −C x + but not ( ) 1 4 3 2 f x = x − Px + Qx − Rx + , and so we
have to deduce the type of f in order to apply the algorithm correctly |
| format |
Thesis |
| qualification_level |
Master's degree |
| author |
Wong, Tze Jin |
| author_facet |
Wong, Tze Jin |
| author_sort |
Wong, Tze Jin |
| title |
The Fourth Order Linear Recurrence Sequence For RSA Type Cryptosystem |
| title_short |
The Fourth Order Linear Recurrence Sequence For RSA Type Cryptosystem |
| title_full |
The Fourth Order Linear Recurrence Sequence For RSA Type Cryptosystem |
| title_fullStr |
The Fourth Order Linear Recurrence Sequence For RSA Type Cryptosystem |
| title_full_unstemmed |
The Fourth Order Linear Recurrence Sequence For RSA Type Cryptosystem |
| title_sort |
fourth order linear recurrence sequence for rsa type cryptosystem |
| granting_institution |
Universiti Putra Malaysia |
| granting_department |
Institute of Mathematical Research |
| publishDate |
2006 |
| url |
http://psasir.upm.edu.my/id/eprint/268/3/549098_ipm_2006_1_abstrak_je__dh_pdf_.pdf |
| _version_ |
1747810188169052160 |