Efficient authentication for mobile and pervasive computing

B Alomair, R Poovendran - IEEE Transactions on Mobile …, 2012 - ieeexplore.ieee.org
With today's technology, many applications rely on the existence of small devices that can
exchange information and form communication networks. In a significant portion of such …

Syllable-PBWT for space-efficient haplotype long-match query

V Wang, A Naseri, S Zhang, D Zhi - Bioinformatics, 2023 - academic.oup.com
Abstract Motivation The positional Burrows–Wheeler transform (PBWT) has led to
tremendous strides in haplotype matching on biobank-scale data. For genetic genealogical …

[HTML][HTML] Restricted linear congruences

K Bibak, BM Kapron, V Srinivasan, R Tauraso… - Journal of Number …, 2017 - Elsevier
In this paper, using properties of Ramanujan sums and of the discrete Fourier transform of
arithmetic functions, we give an explicit formula for the number of solutions of the linear …

On an almost-universal hash function family with applications to authentication and secrecy codes

K Bibak, BM Kapron, V Srinivasan… - International Journal of …, 2018 - World Scientific
Universal hashing, discovered by Carter and Wegman in 1979, has many important
applications in computer science. MMH∗, which was shown to be Δ-universal by Halevi and …

[图书][B] Restricted congruences in computing

K Bibak - 2020 - taylorfrancis.com
Congruences are ubiquitous in computer science, engineering, mathematics, and related
areas. Developing techniques for finding (the number of) solutions of congruences is an …

Efficient authentication for mobile and pervasive computing

R Poovendran, B Alomair - US Patent 9,166,793, 2015 - Google Patents
(57) ABSTRACT A method and system for authenticating messages is pro vided. A message
authentication system generates an encrypted message by encrypting with a key a …

E-MACs: Toward more secure and more efficient constructions of secure channels

B Alomair, R Poovendran - IEEE transactions on computers, 2012 - ieeexplore.ieee.org
In cryptography, secure channels enable the confidential and authenticated message
exchange between authorized users. A generic approach of constructing such channels is …

Constructing embedded lattice-based algorithms for multivariate function approximation with a composite number of points

FY Kuo, W Mo, D Nuyens - Constructive Approximation, 2024 - Springer
We approximate d-variate periodic functions in weighted Korobov spaces with general
weight parameters using n function values at lattice points. We do not limit n to be a prime …

Coprime solutions to axb (mod n)

O Grošek, Š Porubský - Journal of Mathematical Cryptology, 2013 - degruyter.com
It is well known that a congruence ax≡ b (mod n) has a solution if and only if, and, if the
condition is satisfied, the number of incongruent solutions equals. In 2010, Alomair, Clark …

Idempotents, group membership and their applications

Š Porubský - Mathematica Slovaca, 2018 - degruyter.com
Š. Schwarz in his paper [SCHWARZ, Š.: Zur Theorie der Halbgruppen, Sborník prác
Prírodovedeckej fakulty Slovenskej univerzity v Bratislave, Vol. VI, Bratislava, 1943, 64 pp.] …