CMAP-LAP: Configurable Massively Parallel Solver for Lattice Problems

Lattice problems are a class of optimization problems that are notably hard. There are no classical or quantum algorithms known to solve these problems efficiently. Their hardness has made lattices a major cryptographic primitive for post-quantum cryptography. Several different approaches have been...

Celý popis

Podrobná bibliografie

Vydáno v:	Proceedings - International Conference on High Performance Computing s. 42 - 52
Hlavní autoři:	Tateiwa, Nariaki, Shinano, Yuji, Yamamura, Keiichiro, Yoshida, Akihiro, Kaji, Shizuo, Yasuda, Masaya, Fujisawa, Katsuki
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 01.12.2021
Témata:	Conferences Cryptography Discrete optimization Generators High performance computing Lattice problem Lattice-based cryptography Lattices Parallel algorithms Quantum algorithm Shortest vector problem Stability analysis Ubiquity Generator Framework
ISSN:	2640-0316
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!