| dc.creator |
Elverdİ, Ferdi |
|
| dc.creator |
Akleylek, Sedat |
|
| dc.creator |
KIRLAR, Barış Bülent |
|
| dc.date |
2022-01-01T00:00:00Z |
|
| dc.date.accessioned |
2023-01-09T12:09:10Z |
|
| dc.date.available |
2023-01-09T12:09:10Z |
|
| dc.identifier |
e3e07470-821b-44e3-8b9a-a96602deefb9 |
|
| dc.identifier |
10.3906/mat-2102-116 |
|
| dc.identifier |
https://avesis.sdu.edu.tr/publication/details/e3e07470-821b-44e3-8b9a-a96602deefb9/oai |
|
| dc.identifier.uri |
http://acikerisim.sdu.edu.tr/xmlui/handle/123456789/98473 |
|
| dc.description |
© TÜBİTAKMessage recovery is an important property in Nyberg-Rueppel type digital signature algorithms. However, the security of Nyberg-Rueppel type digital signature algorithms depends on the hard problems which might be vulnerable to quantum attacks. Therefore, quantum resistant Nyberg-Rueppel type digital signature algorithms with message recovery property are needed. Since NTRU-based cryptosystems are one of the best studied quantum-resistant schemes, using traditional NTRU encryption scheme has several advantages on the message recovery property. In this paper, we define Nyberg-Rueppel type of NTRU digital signature algorithm. It is carried out by combining NTRU-based encryption and signature algorithms. In the proposed scheme, efficient message recovery property is achieved with the help of NTRU. Then, we compare the computational cost of our Nyberg-Rueppel type signature scheme with the others in terms of the arithmetic complexity. According to the asymptotic complexity results, the proposed scheme has better arithmetic complexity than Nyberg-Rueppel type schemes. We also discuss the security properties of the proposed scheme by modifying attacks on Nyberg-Rueppel type algorithms and lattice-based algorithms |
|
| dc.language |
eng |
|
| dc.rights |
info:eu-repo/semantics/closedAccess |
|
| dc.title |
Efficient Nyberg-Rueppel type of NTRU digital signature algorithm |
|
| dc.type |
info:eu-repo/semantics/article |
|