000			03783nam a22003497a 4500
005			20220904203823.0
006			a|||||r|||| 00| 0
007			tu
008			220220b ||||| |||| 00| 0 eng d
020			_q9781774074176 (e-book)
040			_bEnglish. _cCvSU-CCAT Campus Library. _erda.
050			_aEBOP QA 241 _bN86 2020
245			_aNumber theory with applications to cryptography / _cedited by Stefano Spezia.
260			_aOakville, Ontario : _bArcler Press, _cc2020.
300			_axxi, 309 pages : _bcolor illustrations
336			_2rdacontent _atext _btxt
337			_2rdamedia _acomputer
338			_2rdacarrier _aonline resource
500			_3To access the E-Book : https://www.bibliotex.com/ (Log-in/Register is required).
504			_aIncludes bibliography references and index.
505			_aChapter 1 : A Disaggregation Approach for Solving Linear Diophantine Equations Chapter 2 : Diophantine Equations, Elementary Methods Chapter 3 : Diophantine Equations, Elementary Methods II Chapter 4 : Almost and Nearly Isosceles Pythagorean Triples Chapter 5 : A Public Key Cryptosystem based on DIophantine Equations of Degree Increasing Type Chapter 6 : Hamiltonian for the Zeros of the Riemann Zeta Function Chapter 7 : Fractional Parts and their Relations to the Values of the Riemann Zeta Function Chapter 8 : 11-Dissection and Modulo 11 Congruences Properties for Partition Generating Function Chapter 9 : Effective Congruences for Mock Theta Functions Chapter 10 : On Integer Solutions of the Cubic Equations Over Certain Fields Chapter 11 : Iterative Sliding Window Method for Shorter Number of Operations in Modular Exponentiation and Scalar Chapter 12 : Implementation of Pollard Rho overbinary fields using Brent Cycle Detection Algorithm Chapter 13 : Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside S Chapter 14 : Research on Attacking a Special Elliptic Curve Discrete Logarithm Problem Chapter 15 : Are matrices Useful in Public-Key Cryptography? Chapter 16 : An application of Fibonacci Sequence on Continued Fractions Chapter 17 : On the QuantitativeMetric Theory of Continued Fractions in Positive Characteristic Chapter 18 : Some New Continued Fraction Sequence Convergent to the Somos Quadratfic Reccurance Constant
520			_aNumber Theory with Applications to Cryptography takes into account the application of number theory in the field of cryptography. It comprises elementary methods of Diophantine equations, the basic theorem of arithmetic and the Riemann Zeta function. This book also discusses about Congruences and their use in mock theta functions, Method of Iterative Sliding Window for Shorter Number of Operations in case of Modular Exponentiation and Scalar Multiplication, Discrete log problem, elliptic curves, matrices and public-key cryptography and Implementation of Pollard Rho over binary fields using Brent Cycle Detection Algorithm. It also provides the reader with the significant insights of number theory to the practice of cryptography in order to understand discrete log problem, matrices, elliptic curves and public-key cryptography and the applications of Fibonacci sequence on continued fractions.EBOP0000015
541			_eEBOP00016 _n1
546			_3In English text.
650			_aNumber theory. _93705
650			_aCryptography. _94553
650			_aCoinage, International. _94554
650			_aCryptocurrencies. _94555
700			_aSpezia, Stefano, editor. _94682
856	4	0	_fBibliotex. _3Electronic Resources _zhttps://www.bibliotex.com/product/number-theory-applications-to-cryptography
942			_2lcc _cEB _hQA 241 N86 2020 _kEBOP
999			_c1525 _d1525