Certain sequence of arithmetic progressions and a new key sharing method

DOI10.1007/S12095-019-00416-ZMaRDI QIDQ2202903zbMATH OpenOpenAlexFDO

Authors Ch. Srikanth

Publication date 30 September 2020

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12095-019-00416-z

zbMATH Keywords

Euclidean gcd algorithminteger factoringkey sharing methodquadratic residuosityRSA systemsequence of arithmetic progressions

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Arithmetic progressions (11B25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Primality (11Y11) Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Review text

Let \(A(x, y)\) denote an arithmetic progression with leading term \(x\), and common difference \(y\). The paper under review deals with sequences of arithmetic progressions, \( \langle A(a_0, d_0), A(a_1, d_1), \ldots \rangle\) satisfying the following property: \((a_i + jd_i)(a_i+1 + jd_i+1) \equiv 1\ (\bmod\ a_i + (j + 1)d_i)\). If the common differences \(d_i\) are in decreasing order, the above sequence is uniquely defined for pair of co-prime numbers \((a_0, d_0)\). We denote this unique sequence of progressions by \(G(a_0, d_0)\). In this case the sequence consists only of finitely many distinct arithmetic progressions. Certain consecutive progressions of the \(G(a_0, d_0)\) follow an additive property which lead to define a computational problem (CHP) which it is shown that it is equivalent to the computation of modular square roots of a quadratic residue of the form \(x^2+4y\). Since square root computations modulo an integer \(n\) and factoring \(n\) (i.e, IFP problem) are (probabilistic) equivalent, a computational (probabilistic) equivalence between CHP and IFP is obtained. As an application of this equivalence, a method for sharing random keys securely between users is proposed and a comparison with RSA and Rabin systems is given. Moreover, the advantages of the method, and its potential use-case in the post quantum scenario are discussed.

Recommendations

• A key distribution system equivalent to factoring
• scientific article; zbMATH DE number 1508274
• A public-key cryptosystem based on Lucas sequences
• A simple approach for generating RSA keys
• A research on new public-key encryption schemes

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• An Identity Based Encryption Scheme Based on Quadratic Residues
• scientific article; zbMATH DE number 47996 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Probabilistic encryption
• The development of the number field sieve

This page was built for publication: Certain sequence of arithmetic progressions and a new key sharing method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2202903)