Muutke küpsiste eelistusi

Number-Theoretic Methods in Cryptology: 4th International Conference, NuTMiC 2024, Szczecin, Poland, June 2426, 2024, Revised Selected Papers [Pehme köide]

Edited by , Edited by , Edited by
  • Formaat: Paperback / softback, 331 pages, kõrgus x laius: 235x155 mm, 13 Illustrations, color; 4 Illustrations, black and white; XXIV, 331 p. 17 illus., 13 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 14966
  • Ilmumisaeg: 19-Feb-2025
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031823796
  • ISBN-13: 9783031823794
  • Pehme köide
  • Hind: 63,52 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 74,73 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 331 pages, kõrgus x laius: 235x155 mm, 13 Illustrations, color; 4 Illustrations, black and white; XXIV, 331 p. 17 illus., 13 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 14966
  • Ilmumisaeg: 19-Feb-2025
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031823796
  • ISBN-13: 9783031823794

This book constitutes the refereed post-conference proceedings of the Fourth International Conference on Number-Theoretic Methods in Cryptology, NuTMiC 2024, held in Szczecin, Poland, during June 24–26, 2024.

The 9 full papers and 2 invited papers presented in this book were carefully reviewed and selected from 12 submissions. They were organized in topical sections as follows: invited talks; elliptic curves in cryptography; number theory; algebraic structures and public-key cryptography.

.- Invited Talks.
.- On the efficient representation of isogenies.
.- Elliptic-curves factoring, witnesses and oracles.
.- Elliptic Curves in Cryptography.
.- On chains of pairing-friendly elliptic curves.
.- Faster algorithms for isogeny computations over extensions of finite fields.
.- Integral solutions of some systems of polynomial equations and constructing families of pairing-friendly elliptic curves with small ?-value.
.- Number Theory.
.- Algebraic Equipage for Learning with Errors in Cyclic Division Algebras.
.- From Worst to Average Case to Incremental Search Bounds of the Strong Lucas Test.
.- Algebraic Structures and Public-Key Cryptography.
.- A New Public Key Cryptosystem Based on the Cubic Pell Curve.
.- The Case of Small Prime Numbers Versus the Okamoto-Uchiyama Cryptosystem.
.- Compartment-based and Hierarchical Threshold Delegated Verifiable Accountable Subgroup Multi-signatures.
.- Towards message recovery in NTRU Encryption with auxiliary data.