03077nam 2200745Ia 450 991097285480332120200520144314.09786611035730978128103573812810357349780080488387008048838297815974912421597491241(CKB)1000000000339642(EBL)261284(OCoLC)560260748(SSID)ssj0000111433(PQKBManifestationID)11806621(PQKBTitleCode)TC0000111433(PQKBWorkID)10074802(PQKB)10412198(Au-PeEL)EBL261284(CaPaEBR)ebr10142532(CaONFJC)MIL103573(OCoLC)823108166(PPN)170235688(OCoLC)824876120(OCoLC)ocn824876120 (FR-PaCSA)88809549(CaSebORM)9781597491129(MiAaPQ)EBC261284(FRCYB88809549)88809549(EXLCZ)99100000000033964220060913d2006 uy 0engur|n|---|||||txtccrBigNum math implementing cryptographic multiple precision arithmetic /Tom St. Denis, Greg Rose1st editionRockland, MA Syngress Publishingc20061 online resource (316 p.)Description based upon print version of record.9781597491129 1597491128 Includes bibliographical references (p. 289-290) and index.Cover; Contents; List of Figures; Preface; Chapter 1 Introduction; Chapter 2 Getting Started; Chapter 3 Basic Operations; Chapter 4 Basic Arithmetic; Chapter 5 Multiplication and Squaring; Chapter 6 Modular Reduction; Chapter 7 Exponentiation; Chapter 8 Higher Level Algorithms; Chapter 9 Number Theoretic Algorithms; Bibliography; IndexImplementing cryptography requires integers of significant magnitude to resist cryptanalytic attacks. Modern programming languages only provide support for integers which are relatively small and single precision. The purpose of this text is to instruct the reader regarding how to implement efficient multiple precision algorithms.Bignum math is the backbone of modern computer security algorithms. It is the ability to work with hundred-digit numbers efficiently using techniques that are both elegant and occasionally bizarre. This book introduces the reader to the concept of bignum algorImplementing cryptographic multiple precision arithmeticProgramming (Mathematics)Computer securityProgramming (Mathematics)Computer security.519.7St. Denis Tom627563Rose Greg739049MiAaPQMiAaPQMiAaPQBOOK9910972854803321BigNum math1463995UNINA