Cargando…

Number theoretic methods in cryptography: complexity lower bounds

The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. I...

Descripción completa

Detalles Bibliográficos
Autor principal: Shparlinski, Igor
Lenguaje:eng
Publicado: Springer 1999
Materias:
Acceso en línea:https://dx.doi.org/10.1007/978-3-0348-8664-2
http://cds.cern.ch/record/2006174
_version_ 1780946261184086016
author Shparlinski, Igor
author_facet Shparlinski, Igor
author_sort Shparlinski, Igor
collection CERN
description The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. It also contains a number of open problems and proposals for further research. We obtain several lower bounds, exponential in terms of logp, on the de­ grees and orders of • polynomials; • algebraic functions; • Boolean functions; • linear recurring sequences; coinciding with values of the discrete logarithm modulo a prime p at suf­ ficiently many points (the number of points can be as small as pI/He). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the right­ most bit of the discrete logarithm and defines whether the argument is a quadratic residue. We also obtain non-trivial upper bounds on the de­ gree, sensitivity and Fourier coefficients of Boolean functions on bits of x deciding whether x is a quadratic residue. These results are used to obtain lower bounds on the parallel arithmetic and Boolean complexity of computing the discrete logarithm. For example, we prove that any unbounded fan-in Boolean circuit. of sublogarithmic depth computing the discrete logarithm modulo p must be of superpolynomial size.
id cern-2006174
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 1999
publisher Springer
record_format invenio
spelling cern-20061742021-04-21T20:23:43Zdoi:10.1007/978-3-0348-8664-2http://cds.cern.ch/record/2006174engShparlinski, IgorNumber theoretic methods in cryptography: complexity lower boundsMathematical Physics and MathematicsThe book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. It also contains a number of open problems and proposals for further research. We obtain several lower bounds, exponential in terms of logp, on the de­ grees and orders of • polynomials; • algebraic functions; • Boolean functions; • linear recurring sequences; coinciding with values of the discrete logarithm modulo a prime p at suf­ ficiently many points (the number of points can be as small as pI/He). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the right­ most bit of the discrete logarithm and defines whether the argument is a quadratic residue. We also obtain non-trivial upper bounds on the de­ gree, sensitivity and Fourier coefficients of Boolean functions on bits of x deciding whether x is a quadratic residue. These results are used to obtain lower bounds on the parallel arithmetic and Boolean complexity of computing the discrete logarithm. For example, we prove that any unbounded fan-in Boolean circuit. of sublogarithmic depth computing the discrete logarithm modulo p must be of superpolynomial size.Springeroai:cds.cern.ch:20061741999
spellingShingle Mathematical Physics and Mathematics
Shparlinski, Igor
Number theoretic methods in cryptography: complexity lower bounds
title Number theoretic methods in cryptography: complexity lower bounds
title_full Number theoretic methods in cryptography: complexity lower bounds
title_fullStr Number theoretic methods in cryptography: complexity lower bounds
title_full_unstemmed Number theoretic methods in cryptography: complexity lower bounds
title_short Number theoretic methods in cryptography: complexity lower bounds
title_sort number theoretic methods in cryptography: complexity lower bounds
topic Mathematical Physics and Mathematics
url https://dx.doi.org/10.1007/978-3-0348-8664-2
http://cds.cern.ch/record/2006174
work_keys_str_mv AT shparlinskiigor numbertheoreticmethodsincryptographycomplexitylowerbounds