| Publication | Date of Publication | Type |
|---|
New Correlation Bound and Construction of Quasi-Complementary Code Sets
(available as arXiv preprint) | N/A | Paper |
On the codebook design for NOMA schemes from bent functions
Cryptography and Communications | 2026-10-01 | Paper |
Reduction modulo \(2^{448}-2^{224}-1\)
Mathematical Cryptology | 2026-04-22 | Paper |
Multiple spectrally null constrained complete complementary codes of various lengths over small alphabet
Cryptography and Communications | 2026-03-16 | Paper |
Counting unate and monotone Boolean functions under restrictions of balancedness and non-degeneracy
Journal of Integer Sequences | 2025-07-14 | Paper |
A general model for multi-parameter weighted voting games
International Journal of Game Theory | 2025-07-04 | Paper |
Use of simple arithmetic operations to construct efficiently implementable Boolean functions possessing high nonlinearity and good resistance to algebraic attacks
Discrete Applied Mathematics | 2025-06-30 | Paper |
Balancing inequality reduction against equality of liabilities in a taxation scheme
Journal of Mathematical Economics | 2025-06-13 | Paper |
Pseudo-random walk on ideals: practical speed-up in relation collection for class group computation
Cryptography and Communications | 2025-04-22 | Paper |
A lower bound on the constant in the Fourier min-entropy/influence conjecture
Discrete Applied Mathematics | 2025-02-11 | Paper |
Polynomial hashing over prime order fields
Advances in Mathematics of Communications | 2024-12-03 | Paper |
Construction of spectrally-null-constrained zero-correlation zone sequences with flexible support
Cryptography and Communications | 2024-11-26 | Paper |
| Concrete time/memory trade-offs in generalised Stern's ISD algorithm | 2024-10-23 | Paper |
| Correlation and inequality in weighted majority voting games | 2024-09-11 | Paper |
Concrete analysis of approximate ideal-SIVP to decision ring-LWE reduction
Advances in Mathematics of Communications | 2024-08-06 | Paper |
New correlation bound and construction of quasi-complementary sequence sets
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm
Advances in Mathematics of Communications | 2023-12-14 | Paper |
Another look at key randomisation hypotheses
Designs, Codes and Cryptography | 2023-11-20 | Paper |
Notes on the postulate of the monotonicity in distance in inequality
Bulletin of Economic Research | 2023-10-17 | Paper |
Influence of a Set of Variables on a Boolean Function
SIAM Journal on Discrete Mathematics | 2023-09-27 | Paper |
Distinguishing error of nonlinear invariant attacks
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Combining Montgomery multiplication with tag tracing for the Pollard rho algorithm in prime order fields
Security, Privacy, and Applied Cryptography Engineering | 2023-08-04 | Paper |
New perspectives on the Gini and Bonferroni indices of inequality
Social Choice and Welfare | 2023-07-11 | Paper |
Classical reduction of gap SVP to LWE: a concrete security analysis
Advances in Mathematics of Communications | 2023-07-07 | Paper |
A direct construction of even length ZCPs with large ZCZ ratio
Cryptography and Communications | 2023-06-20 | Paper |
| Counting unate and balanced monotone Boolean functions | 2023-04-27 | Paper |
Kummer versus Montgomery Face-off over Prime Order Fields
ACM Transactions on Mathematical Software | 2023-03-22 | Paper |
On the ``majority is least stable'' conjecture
Information Processing Letters | 2022-10-28 | Paper |
Efficient arithmetic in (pseudo-)Mersenne prime order fields
Advances in Mathematics of Communications | 2022-10-18 | Paper |
Efficient 4-Way Vectorizations of the Montgomery Ladder
IEEE Transactions on Computers | 2022-08-05 | Paper |
Inequality minimising subsidy and taxation
Economic Theory Bulletin | 2022-07-27 | Paper |
Separation results for Boolean function classes
Cryptography and Communications | 2022-03-30 | Paper |
\textsf{FAST}: disk encryption and beyond
Advances in Mathematics of Communications | 2022-01-24 | Paper |
An inequality paradox: relative versus absolute indices?
Metron | 2021-12-16 | Paper |
Breaking tweakable enciphering schemes using Simon's algorithm
Designs, Codes and Cryptography | 2021-08-02 | Paper |
Verifying solutions to LWE with implications for concrete security
Advances in Mathematics of Communications | 2021-05-12 | Paper |
Variants of Wegman-Carter message authentication code supporting variable tag lengths
Designs, Codes and Cryptography | 2021-05-10 | Paper |
Weighted voting procedure having a unique blocker
International Journal of Game Theory | 2021-04-27 | Paper |
| Simpson's Paradox: A Singularity of Statistical and Inductive Inference | 2021-03-31 | Paper |
Kummer for genus one over prime-order fields
Journal of Cryptology | 2020-03-03 | Paper |
Faster initial splitting for small characteristic composite extension degree fields
Finite Fields and their Applications | 2020-02-26 | Paper |
Another look at success probability of linear cryptanalysis
Advances in Mathematics of Communications | 2019-09-19 | Paper |
| A Direct Construction of Z-Complementary Pairs Using Generalized Boolean Functions | 2019-07-31 | Paper |
| A Direct Construction of Optimal ZCCS With Maximum Column Sequence PMEPR Two for MC-CDMA System | 2019-07-02 | Paper |
Evaluating Bernstein-Rabin-Winograd polynomials
Designs, Codes and Cryptography | 2019-02-20 | Paper |
Connecting Legendre with Kummer and Edwards
Advances in Mathematics of Communications | 2019-02-15 | Paper |
Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity
Cryptography and Communications | 2018-08-28 | Paper |
Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses
Cryptography and Communications | 2018-05-28 | Paper |
| Kummer for genus one over prime order fields | 2018-03-08 | Paper |
Rigorous upper bounds on data complexities of block cipher cryptanalysis
Journal of Mathematical Cryptology | 2017-11-06 | Paper |
| Another look at tightness. II: Practical issues in cryptography | 2017-10-23 | Paper |
| A new test statistic for key recovery attacks using multiple linear approximations | 2017-10-23 | Paper |
Efficient Tweakable Enciphering Schemes From (Block-Wise) Universal Hash Functions
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Computing Partial Walsh Transform From the Algebraic Normal Form of a Boolean Function
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Pseudo-Random Functions and Parallelizable Modes of Operations of a Block Cipher
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
On Quantifying the Resistance of Concrete Hash Functions to Generic Multicollision Attacks
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Efficient hardware implementations of brw polynomials and tweakable enciphering schemes
IEEE Transactions on Computers | 2017-07-12 | Paper |
Concrete Analysis and Trade-Offs for the (Complete Tree) Layered Subset Difference Broadcast Encryption Scheme
IEEE Transactions on Computers | 2017-06-20 | Paper |
<monospace>STES</monospace>: A Stream Cipher Based Low Cost Scheme for Securing Stored Data
IEEE Transactions on Computers | 2017-05-16 | Paper |
Reducing Communication Overhead of the Subset Difference Scheme
IEEE Transactions on Computers | 2017-05-16 | Paper |
Efficient Adaptively Secure IBBE From the SXDH Assumption
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields
Advances in Cryptology – EUROCRYPT 2016 | 2016-09-09 | Paper |
On modes of operations of a block cipher for authentication and authenticated encryption
Cryptography and Communications | 2016-07-01 | Paper |
A note on the spectral characterization of correlation immune Boolean functions
Information Processing Letters | 2016-06-16 | Paper |
Another look at normal approximations in cryptanalysis
Journal of Mathematical Cryptology | 2016-06-09 | Paper |
| On Irreducible Polynomials of the Form b(x^d) | 2016-04-28 | Paper |
Another look at XCB
Cryptography and Communications | 2015-11-19 | Paper |
Efficient (anonymous) compact HIBE from standard assumptions
Provable Security | 2015-09-29 | Paper |
Some randomness experiments on TRIVIUM
Security, Privacy, and Applied Cryptography Engineering | 2015-09-18 | Paper |
Tree based symmetric key broadcast encryption
Journal of Discrete Algorithms | 2015-08-24 | Paper |
| A course on cooperative game theory | 2014-11-20 | Paper |
Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector
Cryptography and Communications | 2014-06-20 | Paper |
On some connections between statistics and cryptology
Journal of Statistical Planning and Inference | 2014-03-13 | Paper |
Anonymous constant-size ciphertext HIBE from asymmetric pairings
Cryptography and Coding | 2014-01-17 | Paper |
Practical hybrid (hierarchical) identity-based encryption schemes based on the decisional bilinear Diffie-Hellman assumption
International Journal of Applied Cryptography | 2013-11-15 | Paper |
A new multi-linear universal hash family
Designs, Codes and Cryptography | 2013-09-24 | Paper |
Tweakable enciphering schemes using only the encryption function of a block cipher
Information Processing Letters | 2013-04-04 | Paper |
Complete tree subset difference broadcast encryption scheme and its analysis
Designs, Codes and Cryptography | 2013-01-28 | Paper |
Variants of Waters' dual system primitives using asymmetric pairings. (Extended abstract)
Public Key Cryptography – PKC 2012 | 2012-07-20 | Paper |
Another look at tightness
Selected Areas in Cryptography | 2012-06-08 | Paper |
| Identity-based encryption | 2011-04-07 | Paper |
A trade-off between collision probability and key size in universal hashing using polynomials
Designs, Codes and Cryptography | 2011-04-06 | Paper |
A general mixing strategy for the ECB-Mix-ECB mode of operation
Information Processing Letters | 2010-06-09 | Paper |
Parallelizing explicit formula for arithmetic in the Jacobian of hyperelliptic curves
Lecture Notes in Computer Science | 2010-01-05 | Paper |
PARSHA-256 -- a new parallelizable hash function and a multithreaded implementation.
Lecture Notes in Computer Science | 2010-01-05 | Paper |
Construction of high degree resilient S-boxes with improved nonlinearity
Information Processing Letters | 2009-12-04 | Paper |
Minimal-axiom characterizations of the Coleman and Banzhaf indices of voting power
Mathematical Social Sciences | 2009-11-17 | Paper |
A combinatorial analysis of recent attacks on step reduced SHA-2 family
Cryptography and Communications | 2009-10-26 | Paper |
Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration
Discrete Applied Mathematics | 2009-06-30 | Paper |
Public Key Cryptography – PKC 2004
Lecture Notes in Computer Science | 2009-05-14 | Paper |
A New Mode of Encryption Providing a Tweakable Strong Pseudo-random Permutation
Fast Software Encryption | 2009-04-02 | Paper |
| Identity-based encryption and hierarchical identity-based encryption | 2009-03-24 | Paper |
A General Construction of Tweakable Block Ciphers and Different Modes of Operations
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
HCH: A New Tweakable Enciphering Scheme Using the Hash-Counter-Hash Approach
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Application of LFSRs for Parallel Sequence Generation in Cryptologic Algorithms
Computational Science and Its Applications - ICCSA 2006 | 2009-02-10 | Paper |
Pairing Computation on Twisted Edwards Form Elliptic Curves
Pairing-Based Cryptography – Pairing 2008 | 2009-02-10 | Paper |
New Collision Attacks against Up to 24-Step SHA-2
Progress in Cryptology - INDOCRYPT 2008 | 2009-01-22 | Paper |
A General Construction of Tweakable Block Ciphers and Different Modes of Operations
Information Security and Cryptology | 2009-01-15 | Paper |
Construction of Perfect Nonlinear and Maximally Nonlinear Multiple-Output Boolean Functions Satisfying Higher Order Strict Avalanche Criteria
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
| Improved construction of nonlinear resilient S-boxes | 2008-12-21 | Paper |
