Muutke küpsiste eelistusi

E-raamat: Cryptography and Computational Number Theory

Edited by , Edited by , Edited by , Edited by
  • Formaat - PDF+DRM
  • Hind: 55,56 €*
  • * 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 volume contains the refereed proceedings of the Workshop on Cryptography and Computational Number Theory, CCNT'99, which has been held in Singapore during the week of November 22-26, 1999. The workshop was organized by the Centre for Systems Security of the Na­ tional University of Singapore. We gratefully acknowledge the financial support from the Singapore National Science and Technology Board under the grant num­ ber RP960668/M. The idea for this workshop grew out of the recognition of the recent, rapid development in various areas of cryptography and computational number the­ ory. The event followed the concept of the research programs at such well-known research institutions as the Newton Institute (UK), Oberwolfach and Dagstuhl (Germany), and Luminy (France). Accordingly, there were only invited lectures at the workshop with plenty of time for informal discussions. It was hoped and successfully achieved that the meeting would encourage and stimulate further research in information and computer security as well as in the design and implementation of number theoretic cryptosystems and other related areas. Another goal of the meeting was to stimulate collaboration and more active interaction between mathematicians, computer scientists, practical cryptographers and engineers in academia, industry and government.

Muu info

Springer Book Archives
Computational Number Theory.- On the Dimension and the Number of
Parameters of a Unirational Variety.- On Elements of High Order in Finite
Fields.- Counting the Number of Points on Affine Diagonal Curves.- Small
Values of the Carmichael Function and Cryptographic Applications.- Density
Estimates Related to Gauss Periods.- Distribution of the Coefficients of
Primitive Polynomials over Finite Fields.- The Distribution of the Quadratic
Symbol in Function Fields and a Faster Mathematical Stream Cipher.- Rational
Groups of Elliptic Curves Suitable for Cryptography.- Effective Determination
of the Proportion of Split Primes in Number Fields.- Algorithms for
Generating, Testing and Proving Primes: A Survey.- Elliptic Curve
Factorization Using a Partially Oblivious Function.- The Hermite-Serret
Algorithm and 122 + 332.- Applications of Algebraic Curves to Constructions
of Sequences.- Cryptography.- Designated 2-Verifier Proofs and their
Application to Electronic Commerce.- Divide and Conquer Attacks on Certain
Irregularly Clocked Stream Ciphers.- New Results on the Randomness of Visual
Cryptography Schemes.- Authentication Myths and Misconceptions.- A Survey
of Bit-security and Hard Core Functions.- On the Security of DiffieHellman
Bits.- Polynomial Rings and Efficient Public Key Authentication II.- Security
of Biased Sources for Cryptographic Keys.- Achieving Optimal Fairness from
Biased Coinflips.- The Dark Side of the Hidden Number Problem: Lattice
Attacks on DSA.- Distribution of Modular Sums and the Security of the Server
Aided Exponentiation.- A General Construction for Fail-Stop Signatures using
Authentication Codes.- Robust Additive Secret Sharing Schemes over Zm.- RSA
Public Key Validation.