語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Assessing mathematically the effecti...
~
Chakrabarty, Mousumi.
FindBook
Google Book
Amazon
博客來
Assessing mathematically the effectiveness of a data encryption model.
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Assessing mathematically the effectiveness of a data encryption model./
作者:
Chakrabarty, Mousumi.
面頁冊數:
139 p.
附註:
Source: Dissertation Abstracts International, Volume: 77-03(E), Section: B.
Contained By:
Dissertation Abstracts International77-03B(E).
標題:
Computer science. -
電子資源:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3734395
ISBN:
9781339229805
Assessing mathematically the effectiveness of a data encryption model.
Chakrabarty, Mousumi.
Assessing mathematically the effectiveness of a data encryption model.
- 139 p.
Source: Dissertation Abstracts International, Volume: 77-03(E), Section: B.
Thesis (D.B.A.)--Northcentral University, 2015.
The most popular RSA cryptography produced long ciphertext, decelerated the encryption and decryption time and was unsuitable for encrypting the credit and debit card data. Some studies by combining prime factorization method and discrete logarithm proposed hybrid encryption systems, however, they failed to indicate if these systems could create small ciphertext, accelerate the encryption and decryption time and were suitable for encrypting data embedded within the small devices. Developing countries encountered encryption problems because they lacked researches in finding an efficient encryption model which would support the encryption of the credit and debit card data. This problem could be addressed by generating a data encryption model and comparing its efficiency with the RSA in terms of the ciphertext sizes and the encryption and decryption computation time. The purpose of this experimental study was to compare between the ciphertext sizes, encryption and decryption times when the mathematical operations of the data encryption model a ≡ b(xy)modq modp were used to encrypt and decrypt the customer verification values (CVV) and the ciphertext sizes, encryption and decryption times when the RSA cryptography was applied to encrypt and decrypt the same CVVs. The independent variable in the research was the data encryption model and the dependent variables were the ciphertext sizes, encryption and decryption computation times. The researcher encrypted randomly generated thirty-five CVV numbers and decrypted a single CVV with 354 iterations by using Mathematica 9 and Maple 17. The researcher conducted t-tests for the paired differences between the means for testing the null hypotheses. The t-statistics values were -2.963, -29.107 and -14.666 and their corresponding p-values were .041, 0.000008, and 0.000126. The null hypotheses were rejected at the 95% level of significance and the alternative hypotheses were accepted. The research revealed that the data encryption model produced smaller ciphertext and faster encryption and decryption times than the RSA. Future researches were recommended for exploring the effectiveness of the data encryption model in encrypting the alphabets, its security level, its implementation cost and whether the model would produce smaller cipher text and accelerate the encryption and decryption time than the symmetric key cryptography.
ISBN: 9781339229805Subjects--Topical Terms:
523869
Computer science.
Assessing mathematically the effectiveness of a data encryption model.
LDR
:03338nmm a2200289 4500
001
2073031
005
20160902113941.5
008
170521s2015 ||||||||||||||||| ||eng d
020
$a
9781339229805
035
$a
(MiAaPQ)AAI3734395
035
$a
AAI3734395
040
$a
MiAaPQ
$c
MiAaPQ
100
1
$a
Chakrabarty, Mousumi.
$3
3188258
245
1 0
$a
Assessing mathematically the effectiveness of a data encryption model.
300
$a
139 p.
500
$a
Source: Dissertation Abstracts International, Volume: 77-03(E), Section: B.
500
$a
Advisers: Phillip Schnarrs; Helen Zaikina-Montgomery.
502
$a
Thesis (D.B.A.)--Northcentral University, 2015.
520
$a
The most popular RSA cryptography produced long ciphertext, decelerated the encryption and decryption time and was unsuitable for encrypting the credit and debit card data. Some studies by combining prime factorization method and discrete logarithm proposed hybrid encryption systems, however, they failed to indicate if these systems could create small ciphertext, accelerate the encryption and decryption time and were suitable for encrypting data embedded within the small devices. Developing countries encountered encryption problems because they lacked researches in finding an efficient encryption model which would support the encryption of the credit and debit card data. This problem could be addressed by generating a data encryption model and comparing its efficiency with the RSA in terms of the ciphertext sizes and the encryption and decryption computation time. The purpose of this experimental study was to compare between the ciphertext sizes, encryption and decryption times when the mathematical operations of the data encryption model a ≡ b(xy)modq modp were used to encrypt and decrypt the customer verification values (CVV) and the ciphertext sizes, encryption and decryption times when the RSA cryptography was applied to encrypt and decrypt the same CVVs. The independent variable in the research was the data encryption model and the dependent variables were the ciphertext sizes, encryption and decryption computation times. The researcher encrypted randomly generated thirty-five CVV numbers and decrypted a single CVV with 354 iterations by using Mathematica 9 and Maple 17. The researcher conducted t-tests for the paired differences between the means for testing the null hypotheses. The t-statistics values were -2.963, -29.107 and -14.666 and their corresponding p-values were .041, 0.000008, and 0.000126. The null hypotheses were rejected at the 95% level of significance and the alternative hypotheses were accepted. The research revealed that the data encryption model produced smaller ciphertext and faster encryption and decryption times than the RSA. Future researches were recommended for exploring the effectiveness of the data encryption model in encrypting the alphabets, its security level, its implementation cost and whether the model would produce smaller cipher text and accelerate the encryption and decryption time than the symmetric key cryptography.
590
$a
School code: 1443.
650
4
$a
Computer science.
$3
523869
650
4
$a
Mathematics.
$3
515831
650
4
$a
Banking.
$2
bicssc
$3
1557594
690
$a
0984
690
$a
0405
690
$a
0770
710
2
$a
Northcentral University.
$b
School of Business and Technology Management.
$3
2099493
773
0
$t
Dissertation Abstracts International
$g
77-03B(E).
790
$a
1443
791
$a
D.B.A.
792
$a
2015
793
$a
English
856
4 0
$u
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3734395
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9305899
電子資源
11.線上閱覽_V
電子書
EB
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入