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

quadratic residuosityinteger factoringRSA systemEuclidean gcd algorithmkey sharing methodsequence of arithmetic progressions

Mathematics Subject Classification ID

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

Recommendations

• A key distribution system equivalent to factoring
• Publication:4506274
• 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

• scientific article; zbMATH DE number 47996 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• An Identity Based Encryption Scheme Based on Quadratic Residues
• 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)