Muutke küpsiste eelistusi

Post-Quantum Cryptography: 17th International Workshop, PQCrypto 2026, Saint-Malo, France, April 1416, 2026, Proceedings, Part I [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 448 pages, kõrgus x laius: 235x155 mm, 58 Illustrations, black and white
  • Sari: Lecture Notes in Computer Science
  • Ilmumisaeg: 10-May-2026
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3032226945
  • ISBN-13: 9783032226945
  • Pehme köide
  • Hind: 93,34 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 109,81 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 3-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 448 pages, kõrgus x laius: 235x155 mm, 58 Illustrations, black and white
  • Sari: Lecture Notes in Computer Science
  • Ilmumisaeg: 10-May-2026
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3032226945
  • ISBN-13: 9783032226945
The two-volume set LNCS 16491 + 16492 constitutes the proceedings of the 17th International Workshop on Post-Quantum Cryptography, PQCrypto 2026, held in Saint Malo, France, during April 2026.



The 27 full papers presented in the proceedings were carefully selected and reviewed from 66 submissions. These papers have been organized in the following topical sections:



Part I: Quantum Algorithms and Quantum Security; Code-Based Cryptography; Lattice-Based Cryptography; and PQC Signatures and Implementation Techniques.



Part II: Isogeny- and Group-Action-Based Cryptography; Cryptographic Protocols and PQC Transition; Code-Based Attacks; and Cryptanalysis and Fault Attacks.



 
.- Quantum Algorithms and Quantum Security.
.- On the Practicality of Quantum Sieving Algorithms for the Shortest Vector
Problem.
.- Generic Composition: From Classical to Quantum Security.
.- Tighter Bit-Security Bounds in Quantum Key Search via the Chebyshev
Distance.
.- Code-Based Cryptography.
.- Sparse Vector Reconstruction from Distance Spectrum Using Soft
Information.
.- Hybrid Subsupport Guessing: A New Hybrid Technique for the Rank Decoding
Problem.
.- The Syndrome Weight Distribution in Quasi-Cyclic Codes, Applications to
BIKE and HQC.
.- Cross-Paradigm Models of Restricted Syndrome Decoding with Application to
CROSS.
.- Lattice-Based Cryptography.
.- Generating Falcon Trapdoors via Gibbs Sampler.
.- ABBA: Lattice-based Commitments from Commutators.
.- Learning With Errors with Output Dependencies: LWE, LWR, and Physical
Learning Problems under the Same Umbrella.
.- PQC Signatures and Implementation Techniques.
.- From Arithmetic to Shamir: Secure and Efficient Masking Gadgets for
Multiplications.
.- Multivariate Signatures with Polynomial Factorization.
.- Post-Quantum Adaptor Signatures with Strong Security from Cryptographic
Group Actions.
.- SPIDER: A Faster and Smaller Identity Based Signature from Isogenies.