In the past dozen or so years, cryptology and computational number theory have become increasingly intertwined. Because the primary cryptologic application of number theory is the apparent intractability of certain computations, these two fields could par
Köp den här e-boken och få 1 till GRATIS!
Formatera PDF ● Sidor 172 ● ISBN 9780821892572 ● Redaktör Carl Pomerance ● Utgivare American Mathematical Society ● Publicerad 2012 ● Nedladdningsbara 3 gånger ● Valuta EUR ● ID 5286960 ● Kopieringsskydd Adobe DRM
Kräver en DRM-kapabel e-läsare