Results 161 to 170 of about 11,395 (193)

Efficient Hardware Implementation of PQC Primitives and PQC algorithms Using High-Level Synthesis

2021 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), 2021
Efficient and quantum-resistant Post-Quantum Cryptographic (PQC) algorithms need to be built before development of large-scale quantum, which will break RSA and Elliptic Curve cryptography based existing public key infrastructure. Cryptographers are developing quantum-resistant PQC algorithms, which consist of PQC primitives.
Deepraj Soni, Ramesh Karri
openaire   +1 more source

PQC CSIKE Algorithm on Non-Cyclic Edwards Curves

Cybernetics and Systems Analysis, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bessalov, A. V., Abramov, S. V.
openaire   +2 more sources

PQC

Proceedings of the 18th ACM conference on Information and knowledge management, 2009
Query classification (QC) is a task that aims to classify Web queries into topical categories. Since queries are usually short in length and ambiguous, the same query may need to be classified to different categories according to different people's perspectives.
Bin Cao, Jian-Tao Sun, Evan Wei Xiang, Derek Hao Hu, Qiang Yang, Zheng Chen   +5 more
openaire   +1 more source

Code-based cryptosystems from NIST PQC

2018 IEEE 9th International Conference on Dependable Systems, Services and Technologies (DESSERT), 2018
In this paper we research code-based electronic digital signature schemes, which ware submitted to the contest of post-quantum crypto algorithms NIST PQC. There are explored general characteristics of the algorithms and basic properties and parameters estimated.
Alexandr Kuznetsov, Anastasiia Kiian, Mariia Lutsenko, Iryna Chepurko, Sergii Kavun   +4 more
openaire   +1 more source

Post-Quantum Cryptography (PQC) for Identity Management

ADHYAYAN: A JOURNAL OF MANAGEMENT SCIENCES, 2022
The impending arrival of viable quantum computing is a major worry to modern-day identity management systems that mainly depend on classical public-key cryptography techniques such as RSA and elliptic curve. Such systems are the basis of secure infrastructure in digital identities such as authentication, digital signature and trust models based on ...
openaire   +1 more source

PQC Acceleration Using GPUs: FrodoKEM, NewHope, and Kyber

IEEE Transactions on Parallel and Distributed Systems, 2021
In this article, we present the first GPU implementation for FrodoKEM-976 , NewHope-1024, and Kyber-1024 . These algorithms belong to three different classes of post-quantum algorithms: Learning with errors (LWE), Ring-LWE, and Module-LWE.
Naina Gupta, Arpan Jati, Amit Kumar Chauhan, Anupam Chattopadhyay   +3 more
openaire   +1 more source

High-Speed Hardware Implementation of PQC Algorithm LAC

2020 IEEE 14th International Conference on Anti-counterfeiting, Security, and Identification (ASID), 2020
As the computing power of quantum computers continues to improve, the security of the mathematical problems on current cryptographic algorithm used today will be challenged. It is necessary to formulate the standard of post-quantum cryptographic algorithm. LAC is one of 26 candidates for the Round 2 of NIST PQC contest.
Rui Tong, Yanzhao Yin, Liji Wu, Xiangmin Zhang, Zhenhui Qin, Xingjun Wu, Linlin Su   +6 more
openaire   +1 more source

Post Quantum Cryptography(PQC) - An overview: (Invited Paper)

2020 IEEE High Performance Extreme Computing Conference (HPEC), 2020
We discuss the Post Quantum Cryptography algorithms for key establishment under consideration by NIST for standardization. Three of these, Crystals- Kyber, Classic McEliece and Supersingular Isogeny based Key Encapsulation (SIKE), are representatives of the three classes of hard problems underlying the security of almost all 69 candidate algorithms ...
Manoj Kumar, Pratap Pattnaik
openaire   +1 more source

Classical Misuse Attacks on NIST Round 2 PQC

2020
The US National Institute of Standards and Technology (NIST) recently announced the public-key cryptosystems (\(\mathsf {PKC}\)) that have passed to the second round of the post-quantum standardization process. Most of these \(\mathsf {PKC}\) come in two flavours: a weak IND-CPA version and a strongly secure IND-CCA construction. For the weaker scheme,
Loïs Huguenin-Dumittan, Serge Vaudenay
openaire   +1 more source

Singular Integral Equations with PQC Coefficients and Freely Transformed Argument

Mathematische Nachrichten, 1994
The authors deal with the following equation \[ \sum_{j=1}^\infty \Biggl [a_j (t) \varphi (g_j (t))+ {{b_j (t)} \over {\pi i}} \int_T {{\varphi (\tau)} \over {\tau- g_j (\tau)}} d\tau \Biggr ]+ (K\varphi) (t)= f(t), \qquad t\in T, \] where \(T\) is the complex unit circle and \(f,\varphi\in L^2 (T)\), \(K\) is a compact operator on \(L^2 (T)\), \(a_j\)
Böttcher, A., Karlovich, Yu. I., Silbermann, B.   +2 more
openaire   +2 more sources