Number-Theoretic Methods in Cryptology - Dąbrowski, Andrzej; Pieprzyk, Josef; Pomykała, Jacek; (ed.) - Prospero Internet Bookshop

 
Product details:

ISBN13:9783031823794
ISBN10:3031823796
Binding:Paperback
No. of pages:331 pages
Size:235x155 mm
Language:English
Illustrations: 3 Illustrations, black & white; 11 Illustrations, color
700
Category:

Number-Theoretic Methods in Cryptology

4th International Conference, NuTMiC 2024, Szczecin, Poland, June 24?26, 2024, Revised Selected Papers
 
Publisher: Springer
Date of Publication:
Number of Volumes: 1 pieces, Book
 
Normal price:

Publisher's listprice:
EUR 70.61
Estimated price in HUF:
30 694 HUF (29 232 HUF + 5% VAT)
Why estimated?
 
Your price:

28 238 (26 893 HUF + 5% VAT )
discount is: 8% (approx 2 456 HUF off)
The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
Click here to subscribe.
 
Availability:

Not yet published.
 
  Piece(s)

 
Long description:

This book constitutes the refereed post-conference proceedings of the 4th 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.

Table of Contents:

.- 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.