San Ling

Cem Güneri

IEEE Trans. Inf. Theory, November, 2024

Explicit Low-Bandwidth Evaluation Schemes for Weighted Sums of Reed-Solomon-Coded Symbols.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, August, 2024

On Linear Codes Whose Hermitian Hulls are MDS.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, July, 2024

On the Weights of Linear Codes With Prescribed Automorphisms.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, July, 2024

Improved Spectral Bound for Quasi-Cyclic Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, June, 2024

Constructing quantum error-correcting codes that require a variable amount of entanglement.

[BibT_eX]

[DOI]

Markus Grassl

Quantum Inf. Process., January, 2024

Succinct Non-Subsequence Arguments.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

Fully Dynamic Attribute-Based Signatures for Circuits from Codes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

A further study on the mass formula for linear codes with prescribed hull dimension.

[BibT_eX]

[DOI]

CoRR, 2024

Characterization of Nearly Self-Orthogonal Quasi-Twisted Codes and Related Quantum Codes.

[BibT_eX]

[DOI]

CoRR, 2024

On Linear Codes Whose Hermitian Hulls are MD.

[BibT_eX]

[DOI]

CoRR, 2024

Entanglement-Assisted Quantum Codes from a Class of Unitary Matrices.

[BibT_eX]

[DOI]

Mareth Mam

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors.

[BibT_eX]

[DOI]

J. Cryptol., July, 2023

A Construction of Maximum Distance Profile Convolutional Codes With Small Alphabet Sizes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, May, 2023

New Families of MDS Symbol-Pair Codes From Matrix-Product Codes.

[BibT_eX]

[DOI]

Xu Pan

IEEE Trans. Inf. Theory, March, 2023

Hulls of Reed-Solomon Codes via Algebraic Geometry Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, February, 2023

Generalized negacyclic codes over finite fields.

[BibT_eX]

[DOI]

Jareena Tharnnukhroh

J. Appl. Math. Comput., February, 2023

Type-II polyadic constacyclic codes over finite fields.

[BibT_eX]

[DOI]

Jareena Tharnnukhroh

Discret. Math. Algorithms Appl., February, 2023

Three New Constructions of Optimal Locally Repairable Codes From Matrix-Product Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2023

Bounds and Constructions of Quantum Locally Recoverable Codes from Quantum CSS Codes.

[BibT_eX]

[DOI]

CoRR, 2023

An open problem and a conjecture on binary linear complementary pairs of codes.

[BibT_eX]

[DOI]

Shitao Li

Minjia Shi

CoRR, 2023

New bounds for b-Symbol Distances of Matrix Product Codes.

[BibT_eX]

[DOI]

Xu Pan

CoRR, 2023

A Construction of Asymptotically Optimal Cascaded CDC Schemes via Combinatorial Designs.

[BibT_eX]

[DOI]

Yingjie Cheng

CoRR, 2023

Sharper Asymptotically Optimal CDC Schemes via Combinatorial Designs.

[BibT_eX]

[DOI]

Yingjie Cheng

CoRR, 2023

Four New Families of Quantum Stabilizer Codes from Hermitian Self-Orthogonal MDS codes.

[BibT_eX]

[DOI]

Proceedings of the 12th International Symposium on Topics in Coding, 2023

On Propagation Rules for Entanglement-Assisted Quantum Codes.

[BibT_eX]

[DOI]

Proceedings of the 12th International Symposium on Topics in Coding, 2023

Repair of Reed-Solomon Codes in the Presence of Erroneous Nodes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

A new framework for deniable secure key exchange.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Asymmetric quantum Griesmer codes detecting a single bit-flip error.

[BibT_eX]

[DOI]

Discret. Math., 2022

Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2022

How Much Entanglement Does a Quantum Code Need?

[BibT_eX]

[DOI]

Markus Grassl

CoRR, 2022

Entanglement-Assisted and Subsystem Quantum Codes: New Propagation Rules and Constructions.

[BibT_eX]

[DOI]

CoRR, 2022

On the construction of self-dual cyclic codes over $\mathbb {Z}_{4}$ with arbitrary even length.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2022

Two new classes of Hermitian self-orthogonal non-GRS MDS codes and their applications.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2022

2021

A Comparison of Distance Bounds for Quasi-Twisted Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Adaptive oblivious transfer with access control from lattice assumptions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Binary de Bruijn Sequences via Zech's Logarithms.

[BibT_eX]

[DOI]

SN Comput. Sci., 2021

Patch-Based Holographic Image Sensing.

[BibT_eX]

[DOI]

Alfred Marcel Bruckstein

SIAM J. Imaging Sci., 2021

An explicit expression for Euclidean self-dual cyclic codes of length 2k over Galois ring GR(4, m).

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2021

New Interleaving Constructions of Asymptotically Optimal Periodic Quasi-Complementary Sequence Sets.

[BibT_eX]

[DOI]

CoRR, 2021

Three New Infinite Families of Optimal Locally Repairable Codes from Matrix-Product Codes.

[BibT_eX]

[DOI]

CoRR, 2021

New bounds on the minimum distance of cyclic codes.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2021

Zero-Knowledge Proofs for Committed Symmetric Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Post-Quantum Cryptography - 12th International Workshop, 2021

2020

On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Provably Secure Group Signature Schemes From Code-Based Assumptions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Burst-Deletion-Correcting Codes for Permutations and Multipermutations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Compact Code-Based Signature for Reconfigurable Devices With Side Channel Resilience.

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst. I Regul. Pap., 2020

Lightweight Key Encapsulation Using LDPC Codes on FPGAs.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2020

Robust Positioning Patterns with Low Redundancy.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

Public key encryption with equality test in the standard model.

[BibT_eX]

[DOI]

Inf. Sci., 2020

Insecurity of the Public Key Encryption with Filtered Equality Test Proposed by Huang et al.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Quasi-Cyclic Codes.

[BibT_eX]

[DOI]

Cem Güneri

CoRR, 2020

An explicit expression for Euclidean self-dual cyclic codes of length 2k over Galois ring GR(4, m).

[BibT_eX]

[DOI]

CoRR, 2020

Holographic Image Sensing.

[BibT_eX]

[DOI]

Alfred Marcel Bruckstein

CoRR, 2020

Perfect State Transfer on Cayley Graphs over Dihedral Groups: The Non-Normal Case.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2019

PEIGEN - a Platform for Evaluation, Implementation, and Generation of S-boxes.

[BibT_eX]

[DOI]

IACR Trans. Symmetric Cryptol., 2019

Capacity-Achieving Codes That Mitigate Intercell Interference and Charge Leakage in Flash Memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Private Compound Wildcard Queries Using Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

Myungsun Kim

Hyung Tae Lee

Benjamin Hong Meng Tan

IEEE Trans. Dependable Secur. Comput., 2019

Lattice-based group signatures: Achieving full dynamicity (and deniability) with ease.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Public key encryption with equality test from generic assumptions in the random oracle model.

[BibT_eX]

[DOI]

Inf. Sci., 2019

SoK: Peigen - a Platform for Evaluation, Implementation, and Generation of S-boxes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Multidimensional quasi-twisted codes: equivalent characterizations and their relation to multidimensional convolutional codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

Construction and enumeration for self-dual cyclic codes over Z4 of oddly even length.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

Good Stabilizer Codes from Quasi-Cyclic Codes over F4 and F9.

[BibT_eX]

[DOI]

CoRR, 2019

Server-Aided Revocable Predicate Encryption: Formalization and Lattice-Based Instantiation.

[BibT_eX]

[DOI]

Comput. J., 2019

Search Condition-Hiding Query Evaluation on Encrypted Databases.

[BibT_eX]

[DOI]

Benjamin Hong Meng Tan

IEEE Access, 2019

Binary Robust Positioning Patterns with Low Redundancy and Efficient Locating Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Forward-Secure Group Signatures from Lattices.

[BibT_eX]

[DOI]

Proceedings of the Post-Quantum Cryptography - 10th International Conference, 2019

Non-malleable Coding for Arbitrary Varying Channels.

[BibT_eX]

[DOI]

Fuchun Lin

Reihaneh Safavi-Naini

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Spectral Bounds for Quasi-Twisted Codes.

[BibT_eX]

[DOI]

Jareena Tharnnukhroh

Proceedings of the IEEE International Symposium on Information Theory, 2019

Good Stabilizer Codes from Quasi-Cyclic Codes over F4 and F9.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Threshold Changeable Ramp Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the Cryptology and Network Security - 18th International Conference, 2019

2018

Geometric Orthogonal Codes of Size Larger Than Optical Orthogonal Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

On the Efficiency of FHE-Based Private Queries.

[BibT_eX]

[DOI]

IEEE Trans. Dependable Secur. Comput., 2018

A lattice-based group signature scheme with verifier-local revocation.

[BibT_eX]

[DOI]

Khoa Nguyen

Adeline Roux-Langlois

Theor. Comput. Sci., 2018

Accountable Tracing Signatures from Lattices.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Constant-size Group Signatures from Lattices.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Lattice-Based Zero-Knowledge Arguments for Integer Relations.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Holographic Sensing.

[BibT_eX]

[DOI]

Alfred Marcel Bruckstein

CoRR, 2018

The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2018

Construction of de Bruijn sequences from product of two irreducible polynomials.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2018

New MILP Modeling: Improved Conditional Cube Attacks on Keccak-Based Constructions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017

Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Zero-Knowledge Arguments for Lattice-Based PRFs and Applications to E-Cash.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

On the Closest Vector Problem for Lattices Constructed from Polynomials and Their Cryptographic Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Three new classes of optimal frequency-hopping sequence sets.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2017

Large Order Binary de Bruijn Sequences via Zech's Logarithms.

[BibT_eX]

[DOI]

CoRR, 2017

Hardness of k-LWE and Applications in Traitor Tracing.

[BibT_eX]

[DOI]

Algorithmica, 2017

Revocable Predicate Encryption from Lattices.

[BibT_eX]

[DOI]

Proceedings of the Provable Security, 2017

Permutation codes correcting a single burst deletion II: Stable deletions.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Geometric orthogonal codes better than optical orthogonal codes.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Spectral Analysis of Quasi-Cyclic Product Codes.

[BibT_eX]

[DOI]

Alexander Zeh

IEEE Trans. Inf. Theory, 2016

Analysis of Gong et al.'s CCA2-secure homomorphic encryption.

[BibT_eX]

[DOI]

Hyung Tae Lee

Theor. Comput. Sci., 2016

Semi-generic construction of public key encryption and identity-based encryption with equality test.

[BibT_eX]

[DOI]

Inf. Sci., 2016

Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Better Security for Queries on Encrypted Databases.

[BibT_eX]

[DOI]

Benjamin Hong Meng Tan

IACR Cryptol. ePrint Arch., 2016

Enumeration formulas for self-dual cyclic codes.

[BibT_eX]

[DOI]

Guanghui Zhang

Finite Fields Their Appl., 2016

CCA2 Attack and Modification of Huang et al.'s Public Key Encryption with Authorized Equality Test.

[BibT_eX]

[DOI]

Comput. J., 2016

On self-dual cyclic codes of length pa over GR(p2, s).

[BibT_eX]

[DOI]

Ekkasit Sangwisut

Adv. Math. Commun., 2016

On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

String concatenation construction for Chebyshev permutation channel codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Efficient encoding/decoding of capacity-achieving constant-composition ICI-free codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Rates of constant-composition codes that mitigate intercell interference.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Application of Constacyclic Codes to Quantum MDS Codes.

[BibT_eX]

[DOI]

Guanghui Zhang

IEEE Trans. Inf. Theory, 2015

Polyadic Constacyclic Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-based.

[BibT_eX]

[DOI]

Khoa Nguyen

IACR Cryptol. ePrint Arch., 2015

A Provably Secure Group Signature Scheme from Code-Based Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Hulls of cyclic and negacyclic codes over finite fields.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2015

Quasi-abelian codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2015

Construction of Quasi-Cyclic Product Codes.

[BibT_eX]

[DOI]

Alexander Zeh

CoRR, 2015

2014

Hermitian Self-Dual Abelian Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

On the Multidimensional Distribution of the Naor-Reingold Pseudo-Random Function.

[BibT_eX]

[DOI]

Igor E. Shparlinski

Math. Comput., 2014

A relation between embedding degrees and class numbers of binary quadratic forms.

[BibT_eX]

[DOI]

Enver Ozdemir

Math. Comput., 2014

Low Probability Differentials and the Cryptanalysis of Full-Round CLEFIA-128.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Homogeneous weights of matrix product codes over finite principal ideal rings.

[BibT_eX]

[DOI]

Yun Fan

Finite Fields Their Appl., 2014

Matrix product codes over finite commutative Frobenius rings.

[BibT_eX]

[DOI]

Yun Fan

Des. Codes Cryptogr., 2014

Shorter identity-based encryption via asymmetric pairings.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2014

The relation and transformation between hierarchical inner product encryption and spatial encryption.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2014

Spatial encryption supporting non-monotone access structure.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2014

Hermitian Self-Dual Cyclic Codes of Length $p^a$ over $GR(p^2, s)$.

[BibT_eX]

[DOI]

Ekkasit Sangwisut

CoRR, 2014

Self-dual cyclic codes over finite chain rings.

[BibT_eX]

[DOI]

Guanghui Zhang

CoRR, 2014

The resistance of PRESENT-80 against related-key differential attacks.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2014

Decoding of quasi-cyclic codes up to a new lower bound on the minimum distance.

[BibT_eX]

[DOI]

Alexander Zeh

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Efficient Two-Server Password-Only Authenticated Key Exchange.

[BibT_eX]

[DOI]

Xun Yi

IEEE Trans. Parallel Distributed Syst., 2013

Abelian Codes in Principal Ideal Group Algebras.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

CSS-Like Constructions of Asymmetric Quantum Codes.

[BibT_eX]

[DOI]

Dmitrii V. Pasechnik

IEEE Trans. Inf. Theory, 2013

Upper Bounds on Matching Families in BBZpqn.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

On the Fourier Spectra of New APN Functions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Revocable IBE Systems with Almost Constant-size Key Update.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

A q-polynomial approach to cyclic codes.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2013

New results on two hypercube coloring problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Upper Bounds on Matching Families in $\mathbb{Z}_{pq}^n$

[BibT_eX]

[DOI]

CoRR, 2013

Query-Efficient Locally Decodable Codes of Subexponential Length.

[BibT_eX]

[DOI]

Comput. Complex., 2013

Fully Secure Attribute-Based Systems with Short Ciphertexts/Signatures and Threshold Access Structures.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology - CT-RSA 2013, 2013

2012

Threshold changeable secret sharing schemes revisited.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Constructing irreducible polynomials over finite fields.

[BibT_eX]

[DOI]

Enver Ozdemir

Math. Comput., 2012

Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences.

[BibT_eX]

[DOI]

Math. Comput., 2012

On the modular inversion hidden number problem.

[BibT_eX]

[DOI]

J. Symb. Comput., 2012

On the (In)Security of IDEA in Various Hashing Modes.

[BibT_eX]

[DOI]

Lei Wei

Thomas Peyrin

Przemyslaw Sokolowski

Josef Pieprzyk

IACR Cryptol. ePrint Arch., 2012

Improved Zero-knowledge Proofs of Knowledge for the ISIS Problem, and Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

On the (Im)Plausibility of Constant-Round Public-Coin Straight-Line-Simulatable Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Shorter IBE and Signatures via Asymmetric Pairings.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

A note on linearized polynomials and the dimension of their kernels.

[BibT_eX]

[DOI]

Longjiang Qu

Finite Fields Their Appl., 2012

A note on cyclic codes over GR(p 2, m) of length p k.

[BibT_eX]

[DOI]

Han Mao Kiah

Des. Codes Cryptogr., 2012

Cumulative Distance Enumerators of Random Codes and their Thresholds

[BibT_eX]

[DOI]

CoRR, 2012

Anonymous and Adaptively Secure Revocable IBE with Constant Size Public Parameters

[BibT_eX]

[DOI]

CoRR, 2012

Skew constacyclic codes over finite chain rings.

[BibT_eX]

[DOI]

Patanee Udomkavanich

Adv. Math. Commun., 2012

Feasibility and Practicability of Standardized Cryptography on 4-bit Micro Controllers.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography, 19th International Conference, 2012

NTRUCCA: How to Strengthen NTRUEncrypt to Chosen-Ciphertext Security in the Standard Model.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography - PKC 2012, 2012

Standardized Signature Algorithms on Ultra-constrained 4-Bit MCU.

[BibT_eX]

[DOI]

Proceedings of the Advances in Information and Computer Security, 2012

Differential Attacks against Stream Cipher ZUC.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011

Authentication of Digital Streams.

[BibT_eX]

[DOI]

Christophe Tartary

IEEE Trans. Inf. Theory, 2011

On Self-Dual Cyclic Codes Over Finite Fields.

[BibT_eX]

[DOI]

Yan Jia

IEEE Trans. Inf. Theory, 2011

Additive Asymmetric Quantum Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Side-Channel Resistant Crypto for Less than 2, 300 GE.

[BibT_eX]

[DOI]

J. Cryptol., 2011

Structure of functional codes defined on non-degenerate Hermitian varieties.

[BibT_eX]

[DOI]

Frédéric A. B. Edoukou

J. Comb. Theory A, 2011

Improved Meet-in-the-Middle Cryptanalysis of KTANTAN.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Revocable Identity-Based Encryption from Lattices.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Fully Secure Spatial Encryption under Simple Assumptions with Constant-Size Ciphertexts.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Association schemes arising from bent functions.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2011

List decodability at small radii.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2011

From skew-cyclic codes to asymmetric quantum codes.

[BibT_eX]

[DOI]

Olfa Yemen

Adv. Math. Commun., 2011

Pushing the Limits: A Very Compact and a Threshold Implementation of AES.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Improved Meet-in-the-Middle Cryptanalysis of KTANTAN (Poster).

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy - 16th Australasian Conference, 2011

2010

Asymmetric quantum codes: characterization and constructions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Generalization of Steane's enlargement construction of quantum codes and applications.

[BibT_eX]

[DOI]

Jinquan Luo

IEEE Trans. Inf. Theory, 2010

Application of classical hermitian self-orthogonal MDS codes to quantum MDS codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Linear size optimal q-ary constant-weight codes and constant-composition codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Query-Efficient Locally Decodable Codes.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2010

Checkable Codes from Group Rings

[BibT_eX]

[DOI]

CoRR, 2010

On Asymmetric Quantum MDS Codes

[BibT_eX]

[DOI]

CoRR, 2010

256 Bit Standardized Crypto for 650 GE - GOST Revisited.

[BibT_eX]

[DOI]

Axel Poschmann

Proceedings of the Cryptographic Hardware and Embedded Systems, 2010

On Multidimensional Linear Cryptanalysis.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy - 15th Australasian Conference, 2010

2009

On the Covering Structures of Two Classes of Linear Codes From Perfect Nonlinear Functions.

[BibT_eX]

[DOI]

Chao Li

Longjiang Qu

IEEE Trans. Inf. Theory, 2009

Properties and Applications of Preimage Distributions of Perfect Nonlinear Functions.

[BibT_eX]

[DOI]

Chao Li

Qiang Li

IEEE Trans. Inf. Theory, 2009

Practical pseudo-collisions for hash functions ARIRANG-224/384.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Cyclic Codes and Sequences from Kasami-Welch Functions

[BibT_eX]

[DOI]

Jinquan Luo

CoRR, 2009

Cyclic Codes and Sequences from a Class of Dembowski-Ostrom Functions

[BibT_eX]

[DOI]

Jinquan Luo

CoRR, 2009

On the constructions of constant-composition codes from perfect nonlinear functions.

[BibT_eX]

[DOI]

Chao Li

Qiang Li

Sci. China Ser. F Inf. Sci., 2009

Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding, 2009

Cryptanalysis of the LAKE Hash Family.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption, 16th International Workshop, 2009

2008

Access Structures of Elliptic Secret Sharing Schemes.

[BibT_eX]

[DOI]

Hao Chen

IEEE Trans. Inf. Theory, 2008

Improved Lower Bounds for Constant GC-Content DNA Codes.

[BibT_eX]

[DOI]

Yeow Meng Chee

IEEE Trans. Inf. Theory, 2008

The Sizes of Optimal q -Ary Codes of Weight Three and Distance Four: A Complete Solution.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Cycle Systems in the Complete Bipartite Graph Plus a One-Factor.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Some constructions of (t, m, s)-nets with improved parameters.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2008

Cyclic codes over GR(p2, m) of length pk.

[BibT_eX]

[DOI]

Han Mao Kiah

Finite Fields Their Appl., 2008

Cryptanalysis of Rabbit.

[BibT_eX]

[DOI]

Yi Lu

Proceedings of the Information Security, 11th International Conference, 2008

Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

2007

The PBD-Closure of Constant-Composition Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Constructions for q-Ary Constant-Weight Codes.

[BibT_eX]

[DOI]

Yeow Meng Chee

IEEE Trans. Inf. Theory, 2007

Cryptanalysis of LASH.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Constructions and bounds on linear error-block codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2007

2006

A Lower Bound on the Probability of Undetected Error for Binary Constant Weight Codes.

[BibT_eX]

[DOI]

Shu-Tao Xia

IEEE Trans. Inf. Theory, 2006

On the reliability-order-based decoding algorithms for binary linear block codes.

[BibT_eX]

[DOI]

Yuansheng Tang

IEEE Trans. Inf. Theory, 2006

Asymptotic bounds on quantum codes from algebraic geometry codes.

[BibT_eX]

[DOI]

Keqin Feng

IEEE Trans. Inf. Theory, 2006

Aperiodic and Odd Correlations of Some p-Ary Sequences from Galois Rings.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

On the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots.

[BibT_eX]

[DOI]

Harald Niederreiter

Des. Codes Cryptogr., 2006

Cyclic Codes Over Z4 of Even Length.

[BibT_eX]

[DOI]

Steven T. Dougherty

Des. Codes Cryptogr., 2006

An explicit class of codes with good parameters and their duals.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

The Probability of Undetected Error for Binary Constant-Weight Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

On the algebraic structure of quasi-cyclic codes III: generator theory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Quantum codes from concatenated algebraic-geometric codes.

[BibT_eX]

[DOI]

Hao Chen

IEEE Trans. Inf. Theory, 2005

Improved p-ary Codes and Sequence Families from Galois Rings of Characteristic p2.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

On the variance of average distance of subsets in the Hamming space.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Improved Bounds on Weil Sums over Galois Rings and Homogeneous Weights.

[BibT_eX]

[DOI]

Proceedings of the Coding and Cryptography, International Workshop, 2005

2004

Polyadic codes revisited.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

An improvement on the bounds of Weil exponential sums over Galois rings with some applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

On Viterbi-like algorithms and their application to Reed-Muller codes.

[BibT_eX]

[DOI]

Yuansheng Tang

J. Complex., 2004

Z8-Kerdock codes and pseudorandom binary sequences.

[BibT_eX]

[DOI]

J. Complex., 2004

A family of group character codes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2004

Type II codes over F2m+uF2m.

[BibT_eX]

[DOI]

Koichi Betsumiya

Fidel R. Nemenzo

Discret. Math., 2004

Improved p-ary Codes and Sequence Families from Galois Rings.

[BibT_eX]

[DOI]

Proceedings of the Sequences and Their Applications, 2004

2003

Good self-dual quasi-cyclic codes exist.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

New lower bounds and constructions for binary codes correcting asymmetric errors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

On the Algebraic Structure of Quasi-cyclic Codes II: Chain Rings.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2003

Nonlinear p-ary Sequences.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2003

2002

Zpk+1-Linear codes.

[BibT_eX]

[DOI]

Jason Thomas Blackford

IEEE Trans. Inf. Theory, 2002

New binary linear codes from algebraic curves.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

2001

On the algebraic structure of quasi-cyclic codes I: Finite fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

Duadic codes over Z2k.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound.

[BibT_eX]

[DOI]

Hao Chen

IEEE Trans. Inf. Theory, 2001

Decomposing Quasi-Cyclic Codes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Type II Codes OverF4 + uF4.

[BibT_eX]

[DOI]

Eur. J. Comb., 2001

Duadic Codes over F2 + uF2.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2001

2000

A class of linear codes with good parameters.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

A class of linear codes with good parameters from algebraic curves.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Split group codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Elementary 2-group character codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Secret-sharing with a class of ternary codes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

1999

Attack on RSA-Type Cryptosystems Based on Singular Cubic Curves over Z/nZ.

[BibT_eX]

[DOI]

Seng Kiat Chua

Theor. Comput. Sci., 1999

1998

Explicit Sequence Expansions.

[BibT_eX]

[DOI]

Proceedings of the Sequences and their Applications, 1998

1997

A Rabin-Type Scheme Based on y2 equiv x3 + bx2 mod n.

[BibT_eX]

[DOI]

Seng Kiat Chua

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

Efficient Generation of Elliptic Curve Cryptosystems.

[BibT_eX]

[DOI]

Kwok-Yan Lam