Advantages of Logarithmic Signatures in the Implementation of Crypto Primitives
Computationally complex tasks, or "hard problems" for brevity, is a broad term that encompasses problems that require a significant number of resources to solve. Cryptography uses them by establishing an equivalence between the security of a scheme and the intractability of a complex prob...
Saved in:
| Main Authors: | Yevhen Kotukh, Hennadii Khalimov |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Oles Honchar Dnipro National University
2024-06-01
|
| Series: | Challenges and Issues of Modern Science |
| Subjects: | |
| Online Access: | https://cims.fti.dp.ua/j/article/view/119 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Design and Implementation of a Quantum-Assisted Digital Signature
by: Marta Irene García-Cid, et al.
Published: (2025-01-01) -
Simulation of Shor Algorithm for Discrete Logarithm Problems With Comprehensive Pairs of Modulo <inline-formula><tex-math notation="LaTeX">$p$</tex-math></inline-formula> and Order <inline-formula><tex-math notation="LaTeX">$q$</tex-math></inline-formula>
by: Kaito Kishi, et al.
Published: (2025-01-01) -
Security and Performance Analyses of Post-Quantum Digital Signature Algorithms and Their TLS and PKI Integrations
by: Manohar Raavi, et al.
Published: (2025-06-01) -
Security notions for stateful signature schemes
by: Quan Yuan, et al.
Published: (2022-01-01) -
Lattice‐based nominative signature using pseudorandom function
by: Meenakshi Kansal, et al.
Published: (2021-07-01)