Certain sequence of arithmetic progressions and a new key sharing method

DOI10.1007/s12095-019-00416-zzbMath1454.11225OpenAlexW3003481087MaRDI QIDQ2202903

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

quadratic residuosityinteger factoringRSA systemEuclidean gcd algorithmkey sharing methodsequence of arithmetic progressions

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• The development of the number field sieve
• Probabilistic encryption
• A method for obtaining digital signatures and public-key cryptosystems
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• An Identity Based Encryption Scheme Based on Quadratic Residues

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