English
Related papers

Related papers: A p-adic Height Function Of Cryptanalytic Signific…

200 papers

A divide-and-conquer cryptanalysis can often be mounted against some keystream generators composed of several (nonlinear) independent devices combined by a Boolean function. In particular, any parity-check relation derived from the periods…

Cryptography and Security · Computer Science 2009-04-29 Anne Canteaut , Maria Naya-Plasencia

In this paper we consider the description of homomorphic and fully homomorphic ciphers in the $p$-adic model of encryption. This model describes a wide class of ciphers, but certainly not all. Homomorphic and fully homomorphic ciphers are…

Cryptography and Security · Computer Science 2016-03-25 Andrei Khrennikov , Ekaterina Yurova

We give a direct proof that the Mazur-Tate and Coleman-Gross heights on elliptic curves coincide. The main ingredient is to extend the Coleman-Gross height to the case of divisors with non-disjoint support and, doing some $p$-adic analysis,…

Number Theory · Mathematics 2012-07-26 Jennifer S. Balakrishnan , Amnon Besser

We introduce the arithmetic width of a convex body, defined as the number of distinct values a linear functional attains on the lattice points within the body. Arithmetic width refines lattice width by detecting gaps in the lattice point…

Combinatorics · Mathematics 2025-09-08 Jesús A. De Loera , Brittney Marsters , Christopher O'Neill

We present new algorithms that efficiently approximate the hypergeometric function of a matrix argument through its expansion as a series of Jack functions. Our algorithms exploit the combinatorial properties of the Jack function, and have…

Probability · Mathematics 2007-05-23 Plamen Koev , Alan Edelman

We prove two transformations for the $p$-adic hypergeometric series which can be described as $p$-adic analogues of a Kummer's linear transformation and a transformation of Clausen. We first evaluate two character sums, and then relate them…

Number Theory · Mathematics 2018-02-14 Rupam Barman , Neelam Saikia

Based on our previous work on truly concurrent process algebras APTC, we use it to verify the security protocols. This work (called Secure APTC, abbreviated SAPTC) have the following advantages in verifying security protocols: (1) It has a…

Logic in Computer Science · Computer Science 2021-10-26 Yong Wang

We provide a simple method and relevant theoretical analysis for efficiently estimating higher-order lp distances. While the analysis mainly focuses on l4, our methodology extends naturally to p = 6,8,10..., (i.e., when p is even).…

Machine Learning · Computer Science 2012-03-19 Ping Li , Michael W. Mahoney , Yiyuan She

Confidentiality and Integrity are two paramount objectives in the evaluation of information and communication technology. In this paper, we propose an arithmetic approach for designing asymmetric key cryptography. Our method is based on the…

Cryptography and Security · Computer Science 2020-05-18 Md. Helal Ahmed , Jagmohan Tanti , Sumant Pushp

A method for approximating continuous functions $\mathbb{Z}_{p}^{n}\rightarrow\mathbb{Z}_{p}$ by a linear superposition of continuous functions $\mathbb{Z}_{p}\rightarrow\mathbb{Z}_{p}$ is presented and a polynomial regression model is…

Mathematical Physics · Physics 2025-04-02 Alexander P. Zubarev

We use a $p$-adic analogue of the analytic subgroup theorem of W\"ustholz to deduce the transcendence and linear independence of some new classes of $p$-adic numbers. In particular we give $p$-adic analogues of results of W\"ustholz…

Number Theory · Mathematics 2016-01-12 Clemens Fuchs , Duc Hiep Pham

In number theory, we know Legendre's formula $ v_p(n!) = \sum_{k \ge 1} \lfloor \frac{n}{p^k} \rfloor $, which calculates the $p$-adic valuation of the factorial, i.e. the exponent of the greatest power of a prime $p$ that divides $n!$.…

Number Theory · Mathematics 2019-07-30 Gennady Eremin

We consider the algorithm for verified integration of piecewise analytic functions given by Petras. The analysis of the algorithm contained in Patras' paper is limited to a narrow class of functions and gives upper bounds only. We present…

Numerical Analysis · Computer Science 2016-03-15 Małgorzata Moczurad , Piotr Zgliczyński

A complex number alpha is said to satisfy the height reducing property if there is a finite subset F of the ring Z of the rational integers such that Z[alpha]=F[alpha]. This problem of finding F has been considered by several authors,…

Number Theory · Mathematics 2012-12-21 Shigeki Akiyama , Toufik Zaimi

The development of algorithmic fractal dimensions in this century has had many fruitful interactions with geometric measure theory, especially fractal geometry in Euclidean spaces. We survey these developments, with emphasis on connections…

Computational Complexity · Computer Science 2020-07-29 Jack H. Lutz , Elvira Mayordomo

We study two important operations on polynomials defined over complete discrete valuation fields: Euclidean division and factorization. In particular, we design a simple and efficient algorithm for computing slope factorizations, based on…

Number Theory · Mathematics 2016-02-04 Xavier Caruso , David Roe , Tristan Vaccon

We report on implementations for algorithms treating algebraic and arithmetic properties of hypergeometric functions in the computer algebra system SageMath. We treat hypergeometric series over the rational numbers, over finite fields, and…

Symbolic Computation · Computer Science 2026-02-05 Xavier Caruso , Florian Fürnsinn

With the rising popularity of the internet and the widespread use of networks and information systems via the cloud and data centers, the privacy and security of individuals and organizations have become extremely crucial. In this…

Cryptography and Security · Computer Science 2024-02-27 Zakaria Tolba

We described a wide class of $p$-adic refinable equations generating $p$-adic multiresolution analysis. A method for the construction of $p$-adic orthogonal wavelet bases within the framework of the MRA theory is suggested. A realization of…

General Mathematics · Mathematics 2007-11-20 A. Yu. Khrennikov , V. M. Shelkovich , M. Skopina

A novel original procedure of encryption/decryption based on the polyadic algebraic structures and on signal processing methods is proposed. First, we use signals with integer amplitudes to send information. Then we use polyadic techniques…

Cryptography and Security · Computer Science 2025-11-14 Steven Duplij , Qiang Guo