scientific article; zbMATH DE number 1996491

zbMATH Open1040.11058MaRDI QIDQ4432461FDOQ4432461

Authors: Igor E. Shparlinski 

Publication date: 2002

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1866880
• Exponential sums and coding theory: A review
• Number theoretic methods in cryptography. Complexity lower bounds
• scientific article; zbMATH DE number 953231
• scientific article; zbMATH DE number 1339097

zbMATH Keywords

algorithmscorrelationautocorrelationexponential sumscryptographycharacter sumscryptologycoding theoryperiodic sequencesminimal distancelattice reduction algorithmsdimension of BCH-codes

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cryptography (94A60) Trigonometric and exponential sums (general theory) (11L03) Estimates on exponential sums (11L07) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15) Estimates on character sums (11L40) Research exposition (monographs, survey articles) pertaining to number theory (11-02)

Cited In (11)

• Title not available (Why is that?)
• On an example of finite hybrid quasi-Monte Carlo point sets
• On monomial exponential sums in certain index 2 cases and their connections to coding theory
• Topics related to character sums
• Exponential sums, Gauss sums and cyclic codes
• Classical simulation of quantum circuits by half Gauss sums
• Index bounds for character sums of polynomials over finite fields
• On the Multidimensional Distribution of the Naor–Reingold Pseudo-Random Function
• Proof techniques in quasi-Monte Carlo theory
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4432461)