default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew Klapper
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j55]Zhixiong Chen
, Andrew Klapper:
On q-nearly bent Boolean functions. Discret. Appl. Math. 279: 210-217 (2020)
2010 – 2019
- 2019
- [j54]Zhixiong Chen, Ting Gu, Andrew Klapper:
On the q-bentness of Boolean functions. Des. Codes Cryptogr. 87(1): 163-171 (2019) - [i2]Zhixiong Chen, Andrew Klapper:
On q-nearly bent Boolean functions. CoRR abs/1905.00150 (2019) - 2018
- [j53]Andrew Klapper:
Matrix parametrized shift registers. Cryptogr. Commun. 10(2): 369-382 (2018) - [j52]Ting Gu, Zhixiong Chen, Andrew Klapper:
Correlation immune functions with respect to the q-transform. Cryptogr. Commun. 10(6): 1063-1073 (2018) - [j51]Weihua Liu, Andrew Klapper, Zhixiong Chen:
Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction. Des. Codes Cryptogr. 86(5): 1023-1038 (2018) - [j50]Andrew Klapper, Zhixiong Chen:
On the Nonexistence of q-Bent Boolean Functions. IEEE Trans. Inf. Theory 64(4): 2953-2961 (2018) - 2017
- [j49]Weihua Liu, Andrew Klapper:
AFSRs synthesis with the extended Euclidean rational approximation algorithm. Adv. Math. Commun. 11(1): 139-150 (2017) - [j48]Francis N. Castro, Domingo Gómez-Pérez, Andrew Klapper, Ivelisse Rubio, Min Sha, Andrew Z. Tirkel:
Editorial. Adv. Math. Commun. 11(2): i (2017) - [i1]Zhixiong Chen, Ting Gu, Andrew Klapper:
On the q-Bentness of Boolean Functions. CoRR abs/1711.02917 (2017) - 2016
- [j47]Ting Gu, Andrew Klapper:
Statistical properties of half-ℓ-sequences. Cryptogr. Commun. 8(3): 383-400 (2016) - [j46]Andrew Klapper:
A New Transform Related to Distance From a Boolean Function. IEEE Trans. Inf. Theory 62(5): 2798-2812 (2016) - 2015
- [j45]Nicholas Mattei, Judy Goldsmith, Andrew Klapper, Martin Mundhenk:
On the complexity of bribery and manipulation in tournaments with uncertain information. J. Appl. Log. 13(4): 557-581 (2015) - 2014
- [j44]Claude Carlet, Andrew Klapper:
On the arithmetic Walsh coefficients of Boolean functions. Des. Codes Cryptogr. 73(2): 299-318 (2014) - [c30]Andrew Klapper:
A New Transform Related to Distance from a Boolean Function (Extended Abstract). SETA 2014: 47-59 - [c29]Weihua Liu, Andrew Klapper:
A Lattice Rational Approximation Algorithm for AFSRs Over Quadratic Integer Rings. SETA 2014: 200-211 - [c28]Ting Gu, Andrew Klapper:
Distribution Properties of Half- \ell -Sequence. SETA 2014: 234-245 - [p2]Andrew Klapper:
Open Problems on With-Carry Sequence Generators. Open Problems in Mathematics and Computational Science 2014: 181-201 - 2012
- [j43]Xiaoni Du, Andrew Klapper, Zhixiong Chen:
Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations. Inf. Process. Lett. 112(6): 233-237 (2012) - [j42]Andrew Klapper, Mark Goresky:
Arithmetic Correlations and Walsh Transforms. IEEE Trans. Inf. Theory 58(1): 479-492 (2012) - [c27]Nicholas Scott Mattei, Judy Goldsmith, Andrew Klapper:
On the Complexity of Bribery and Manipulation in Tournaments with Uncertain Information. AAAI Fall Symposium: Machine Aggregation of Human Judgment 2012 - [c26]Nicholas Mattei, Judy Goldsmith, Andrew Klapper:
On the Complexity of Bribery and Manipulation in Tournaments with Uncertain Information. FLAIRS 2012 - [c25]Andrew Klapper:
Arithmetic Walsh Transform of Quadratic Boolean Functions - (Extended Abstract). SETA 2012: 65-76 - 2011
- [j41]Mark Goresky, Andrew Klapper:
Statistical Properties of the Arithmetic Correlation of Sequences. Int. J. Found. Comput. Sci. 22(6): 1297-1315 (2011) - 2010
- [j40]Andrew Klapper:
Expected pi-adic security measures of sequences. IEEE Trans. Inf. Theory 56(5): 2486-2501 (2010) - [c24]Andrew Klapper, Mark Goresky:
A With-Carry Walsh Transform - (Extended Abstract). SETA 2010: 217-228
2000 – 2009
- 2009
- [j39]Andrew Klapper, Andrew Mertz:
The two covering radius of the two error correcting BCH code. Adv. Math. Commun. 3(1): 83-95 (2009) - [j38]Ramakanth Kavuluru, Andrew Klapper:
Lower bounds on error complexity measures for periodic LFSR and FCSR sequences. Cryptogr. Commun. 1(1): 95-116 (2009) - 2008
- [c23]Ramakanth Kavuluru, Andrew Klapper:
Counting Functions for the k-Error Linear Complexity of 2n-Periodic Binary Sequences. Selected Areas in Cryptography 2008: 151-164 - [c22]Mark Goresky, Andrew Klapper:
Some Results on the Arithmetic Correlation of Sequences. SETA 2008: 71-80 - [c21]Andrew Klapper:
Expected pi-Adic Security Measures of Sequences. SETA 2008: 219-229 - 2007
- [j37]Andrew Klapper:
The asymptotic behavior of N-adic complexity. Adv. Math. Commun. 1(3): 307-319 (2007) - [c20]Ramakanth Kavuluru, Andrew Klapper:
On the k -Operation Linear Complexity of Periodic Sequences. INDOCRYPT 2007: 322-330 - [c19]Andrew Klapper:
The Asymptotic Behavior of pi-Adic Complexity with pi2 = - 2. SSC 2007: 134-146 - 2006
- [j36]Andrew Klapper:
Linear Complexity of Sequences under Different Interpretations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(9): 2254-2257 (2006) - [j35]Mark Goresky, Andrew Klapper:
Pseudonoise sequences based on algebraic feedback shift registers. IEEE Trans. Inf. Theory 52(4): 1649-1662 (2006) - [c18]Andrew Klapper, Andrew Mertz:
The Two Covering Radius of the Two Error Correcting BCH Code. ISIT 2006: 2496-2500 - [c17]Mark Goresky, Andrew Klapper:
Periodicity and Distribution Properties of Combined FCSR Sequences. SETA 2006: 334-341 - 2004
- [j34]Andrew Klapper, Jinzhong Xu:
Register Synthesis for Algebraic Feedback Shift Registers Based on Non-Primes. Des. Codes Cryptogr. 31(3): 227-250 (2004) - [j33]Mark Goresky, Andrew Klapper:
Periodicity and Correlation Properties of d-FCSR Sequences. Des. Codes Cryptogr. 33(2): 123-148 (2004) - [j32]Andrew Klapper:
Distributional properties of d-FCSR sequences. J. Complex. 20(2-3): 305-317 (2004) - [j31]Mark Goresky, Andrew Klapper, Ram Murty, Igor E. Shparlinski:
On Decimations of l-Sequences. SIAM J. Discret. Math. 18(1): 130-140 (2004) - [j30]Andrew Klapper, Claude Carlet:
Spectral methods for cross correlations of geometric sequences. IEEE Trans. Inf. Theory 50(1): 229-232 (2004) - [j29]Andrew Klapper:
Improved multicovering bounds from linear inequalities and supercodes. IEEE Trans. Inf. Theory 50(3): 532-536 (2004) - [c16]Andrew Klapper:
Pseudonoise sequences based on algebraic function fields. ISIT 2004: 75 - [c15]Andrew Klapper:
A Survey of Feedback with Carry Shift Registers. SETA 2004: 56-71 - [c14]Andrew Klapper:
Algebraic Feedback Shift Registers Based on Function Fields. SETA 2004: 282-297 - 2003
- [j28]Mark Goresky, Andrew Klapper:
Efficient multiply-with-carry random number generators with maximal period. ACM Trans. Model. Comput. Simul. 13(4): 310-321 (2003) - 2002
- [j27]Iiro S. Honkala, Andrew Klapper:
Multicovering Bounds from Relative Covering Radii. SIAM J. Discret. Math. 15(2): 228-234 (2002) - [j26]Mark Goresky, Andrew Klapper:
Fibonacci and Galois representations of feedback-with-carry shift registers. IEEE Trans. Inf. Theory 48(11): 2826-2836 (2002) - 2001
- [j25]Iiro S. Honkala, Andrew Klapper:
Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers. Des. Codes Cryptogr. 23(2): 131-146 (2001) - [j24]Andrew Klapper:
Multicovering Bounds from Linear Inequalities (Extended Abstract). Electron. Notes Discret. Math. 6: 25-34 (2001) - [j23]Andrew Klapper:
On the Existence of Secure Keystream Generators. J. Cryptol. 14(1): 1-15 (2001) - [j22]Wei Sun, Andrew Klapper, Yixian Yang:
On correlations of a family of generalized geometric sequences. IEEE Trans. Inf. Theory 47(6): 2609-2618 (2001) - [c13]Mark Goresky, Andrew Klapper, Ram Murty:
On the Distinctness of Decimations of ℓ-Sequences. SETA 2001: 197-208 - 2000
- [j21]Mark Goresky, Andrew Klapper, Lawrence C. Washington:
Fourier transforms and the 2-adic span of periodic binary sequences. IEEE Trans. Inf. Theory 46(2): 687-691 (2000)
1990 – 1999
- 1999
- [j20]Andrew Klapper, Jinzhong Xu:
Algebraic Feedback Shift Registers. Theor. Comput. Sci. 226(1-2): 61-92 (1999) - [j19]Andrew Klapper:
Improved lower bounds for multicovering codes. IEEE Trans. Inf. Theory 45(7): 2532-2534 (1999) - [p1]Andrew Klapper:
Pseudorandom Sequences and Stream Ciphers. Algorithms and Theory of Computation Handbook 1999 - 1998
- [c12]Iiro S. Honkala, Andrew Klapper:
Multicovering Radii of Reed-Muller Codes and the Existence of Secure Stream Ciphers (Extended Abstract). SETA 1998: 254-262 - [c11]Jinzhong Xu, Andrew Klapper:
Feedback with Carry Shift Registers over Z / (N). SETA 1998: 379-392 - 1997
- [j18]Andrew Klapper:
Cross-Correlations of Quadratic Form Sequences in Odd Characteristic. Des. Codes Cryptogr. 11(3): 289-305 (1997) - [j17]Andrew Klapper, Mark Goresky:
Feedback Shift Registers, 2-Adic Span, and Combiners with Memory. J. Cryptol. 10(2): 111-147 (1997) - [j16]Mark Goresky, Andrew Klapper:
Arithmetic crosscorrelations of feedback with carry shift register sequences. IEEE Trans. Inf. Theory 43(4): 1342-1345 (1997) - [j15]Andrew Klapper:
The multicovering radii of codes. IEEE Trans. Inf. Theory 43(4): 1372-1377 (1997) - 1996
- [j14]Andrew Klapper:
Partial period crosscorrelations of geometric sequences. IEEE Trans. Inf. Theory 42(1): 256-260 (1996) - [j13]Andrew Klapper:
Large families of sequences with near-optimal correlations and large linear span. IEEE Trans. Inf. Theory 42(4): 1241-1248 (1996) - [c10]Andrew Klapper:
On the Existence of Secure Feedback Registers (Extended Abstract). EUROCRYPT 1996: 256-267 - 1995
- [j12]Andrew Klapper:
d-form sequences: families of sequences with low correlation values and large linear spans. IEEE Trans. Inf. Theory 41(2): 423-431 (1995) - [c9]Andrew Klapper, Mark Goresky:
Cryptanalysis Based on 2-Adic Rational Approximation. CRYPTO 1995: 262-273 - [c8]Andrew Klapper, Mark Goresky:
Large Periods Nearly de Bruijn FCSR Sequences. EUROCRYPT 1995: 263-273 - 1994
- [j11]Andrew Klapper:
The Vulnerability of Geometric Sequences Based on Fields of Odd Characteristic. J. Cryptol. 7(1): 33-51 (1994) - [j10]Luke O'Connor, Andrew Klapper:
Algebraic Nonlinearity and Its Applications to Cryptography. J. Cryptol. 7(4): 213-227 (1994) - [j9]Andrew Klapper, Mark Goresky:
Partial period autocorrelations of geometric sequences. IEEE Trans. Inf. Theory 40(2): 494-502 (1994) - [c7]Mark Goresky, Andrew Klapper:
Feedback Registers Based on Ramified Extensions of the 2-Adic Numbers (Extended Abstract). EUROCRYPT 1994: 215-222 - [c6]Andrew Klapper:
Feedback with Carry Shift Registers over Finite Fields (extended abstract). FSE 1994: 170-178 - 1993
- [j8]Andrew Klapper, Agnes Hui Chan, Mark Goresky:
Cross-Correlations of Linearly and Quadratically Related Geometric Sequences and GMW Sequences. Discret. Appl. Math. 46(1): 1-20 (1993) - [j7]Andrew Klapper:
Cross-Correlations of Geometric Sequences in Characteristic Two. Des. Codes Cryptogr. 3(4): 347-377 (1993) - [j6]Andrew Klapper, Agnes Hui Chan, Mark Goresky:
Cascaded GMW sequences. IEEE Trans. Inf. Theory 39(1): 177-183 (1993) - [c5]Andrew Klapper, Mark Goresky:
2-Adic Shift Registers. FSE 1993: 174-178 - 1992
- [j5]Andrew Klapper:
Distributed Event Algebras. J. Comput. Syst. Sci. 44(3): 411-424 (1992) - [c4]Andrew Klapper:
The Vulnerability of Geometric Sequences Based on Fields on Odd Characteristic. AUSCRYPT 1992: 327-338 - 1991
- [j4]Margaret M. Bayer, Andrew Klapper:
A New Index for Polytopes. Discret. Comput. Geom. 6: 33-47 (1991) - [c3]Andrew Klapper, Mark Goresky:
Revealing Information with Partial Period Correlations (Extended Abstract). ASIACRYPT 1991: 277-287 - 1990
- [j3]Agnes Hui Chan, Mark Goresky, Andrew Klapper:
On the linear complexity of feedback registers. IEEE Trans. Inf. Theory 36(3): 640-644 (1990) - [c2]Agnes Hui Chan, Mark Goresky, Andrew Klapper:
Correlation Functions of Geometric Sequences. EUROCRYPT 1990: 214-221
1980 – 1989
- 1989
- [j2]Andrew Klapper:
Generalized Lowness and Highness and Probabilistic Complexity Classes. Math. Syst. Theory 22(1): 37-45 (1989) - [c1]Agnes Hui Chan, Mark Goresky, Andrew Klapper:
On the Linear Complexity of Feedback Registers (Extended Abstract). EUROCRYPT 1989: 563-570 - 1987
- [j1]Andrew Klapper:
A Lower Bound on the Complexity of the Convex Hull Problem for Simple Polyhedra. Inf. Process. Lett. 25(3): 159-161 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
