This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Riferimenti bibliografici
Bauer F. L., Decrypted Secrets: Methods and Maxims of Cryptology, Springer (2000).
Boneh D., Twenty Years of Attacks on the RSA Cryptosystem, Notices Amer. Mat. Soc. 46 (1999), 203–213.
Boneh D., Venkatesan R., Breaking RSA may not be Equivalent to Factoring, Proc. Eurocrypt 1998, Lecture Notes in Comp. Sci. 1233, Springer (1998), 59–71.
Chor B., Rivest R. L., A Knapsack Type Cryptosystem Based on Arithmetic in Finite Fields, IEEE Trans. Inform. Theory 34 (1988), 901–909.
Diffie W., Hellman M., New Directions in Cryptography, IEEE Trans. Inform. Soc. 22 (1976), 644–654.
ElGamal T., A Public Key Cryptosystem and Signature Scheme based on Discrete Logarithms, IEEE Trans. Inform. Theory IT-31 (1985), 469–473.
Goldwasser S., Micali S., Probabilistic Encryption and How to Play Mental Poker keeping Secret all Partial Information, Proc. 14th Annual ACM Symp. on Theory of Computing (1982), 365–377.
Merkle R., Hellman M., Hiding Information and Signature in Trap-door Knapsacks, IEEE Trans. Inform. Theory IT-24 (1978), 525–530.
Koblitz N., A Course in Number Theory and Cryptography, Springer (1994).
Massey J. L., Logarithms in Finite Cyclic Groups-Cryptographic Issues, Proc. 4th Benelux Symp. on Inform. Theory (1983), 17–25.
Menezes A., Elliptic Curve Public Key Cryptosystems, Kluwer (1993).
Menezes A., van Oorschot P., Vanstone S., Handbook of Applied Cryptography, CRC Press (1996).
Rivest R., Cryptography, 719–755 in [72].
Rivest R. L., Shamir A., Adleman L. M., A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Comm. ACM 21 (1978), 120–126.
Salomaa A., Public-Key Cryptography, Springer (1996).
Shamir A., A Polynomial-time Algorithm for Breaking the basic Merkle-Hellman Cryptosystem, IEEE Trans. Inform. Theory 30 (1984), 699–704.
Shor P., Algorithms for Quantum Computation: Discrete Logarithms and Factoring, Proc. 35th Annual Symp. Found. Comp. Sci. (1994), 124–134.
Shor P., Polynomial-time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM Rewiew 41 (1999), 303–332.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Italia, Milano
About this chapter
Cite this chapter
Leonesi, S., Toffalori, C. (2006). Ancora Crittografia. In: Numeri e Crittografia. UNITEXT(). Springer, Milano. https://doi.org/10.1007/88-470-0477-2_6
Download citation
DOI: https://doi.org/10.1007/88-470-0477-2_6
Publisher Name: Springer, Milano
Print ISBN: 978-88-470-0331-6
Online ISBN: 978-88-470-0477-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)