276,09 €
Primality Testing and Integer Factorization in Public-Key Cryptography
- Sold out
Primality Testing and Integer Factorization in Public-Key Cryptography
El. knyga:
276,09 €
Many practical public-key cryptosystems and protocols such as RSA (Rivest-Shamir-Adleman) rely their security on computational intractability of Integer Factorization Problem (IFP). This title provides a survey of progress in primality testing and integer factorization, with implications to factoring based public key cryptography.
0
/https://libri-media.knygos-static.lt/a8a76af5-7e43-41ea-9206-b91f875287d4/1)
- Author: Song Y. Yan
- Publisher: Springer-Verlag GmbH
- Year: 2009
- ISBN: 9780387772684
- ISBN-10: 0387772685
- ISBN-13: 9780387772684
- Format: PDF
- Language: English
Primality Testing and Integer Factorization in Public-Key Cryptography (e-book) (used book) | bookbook.eu
Reviews
Description
Many practical public-key cryptosystems and protocols such as RSA (Rivest-Shamir-Adleman) rely their security on computational intractability of Integer Factorization Problem (IFP). This title provides a survey of progress in primality testing and integer factorization, with implications to factoring based public key cryptography.
- Author: Song Y. Yan
- Publisher: Springer-Verlag GmbH
- Year: 2009
- ISBN: 9780387772684
- ISBN-10: 0387772685
- ISBN-13: 9780387772684
- Format: PDF
- Language: English English
Many practical public-key cryptosystems and protocols such as RSA (Rivest-Shamir-Adleman) rely their security on computational intractability of Integer Factorization Problem (IFP). This title provides a survey of progress in primality testing and integer factorization, with implications to factoring based public key cryptography.
Reviews