Muutke küpsiste eelistusi

E-raamat: Number-Theoretic Methods in Cryptology: 4th International Conference, NuTMiC 2024, Szczecin, Poland, June 24-26, 2024, Revised Selected Papers

Edited by , Edited by , Edited by
  • Formaat - PDF+DRM
  • Hind: 74,09 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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.