The Experts below are selected from a list of 3165 Experts worldwide ranked by ideXlab platform
Hemen Dutta - One of the best experts on this subject based on the ideXlab platform.
-
Classical stabilities of Multiplicative Inverse difference and adjoint functional equations
Advances in Difference Equations, 2020Co-Authors: B. V. Senthil Kumar, Khalifa Al-shaqsi, Hemen DuttaAbstract:The aim of this present article is to investigate various classical stability results of the Multiplicative Inverse difference and adjoint functional equations $$ m_{d} \biggl(\frac{rs}{r+s} \biggr)-m_{d} \biggl( \frac{2rs}{r+s} \biggr)= \frac{1}{2} \bigl[m_{d}(r)+m_{d}(s) \bigr] $$ and $$ m_{a} \biggl(\frac{rs}{r+s} \biggr)+m_{a} \biggl( \frac{2rs}{r+s} \biggr)= \frac{3}{2} \bigl[m_{a}(r)+m_{a}(s) \bigr] $$ in the framework of non-zero real numbers. A proper counter-example is illustrated to prove the failure of the stability results for control cases. The relevance of these functional equations in optics is also discussed.
-
Estimation of Inexact Multiplicative Inverse Type Quindecic and Sexdecic Functional Equations in Felbin’s Type Fuzzy Normed Spaces
Multiplicative Inverse Functional Equations, 2020Co-Authors: B. V. Senthil Kumar, Hemen DuttaAbstract:This chapter is devoted to demonstrate the validation of various stabilities of Multiplicative Inverse quindecic and Multiplicative Inverse sexdecic functional equations via fixed point technique in the framework of Felbin’s type fuzzy normed spaces. Proper illustrations are presented to disprove the stability results for singular cases.
-
Inexact Solution of Multiplicative Inverse Type Trevigintic and Quottuorvigintic Functional Equations in Matrix Normed Spaces
Multiplicative Inverse Functional Equations, 2020Co-Authors: B. V. Senthil Kumar, Hemen DuttaAbstract:In this chapter, an inexact solution near to the exact solution of a Multiplicative Inverse trevigintic and quottuorvigintic functional equations are achieved in the sense of Ulam stability hypothesis in matrix normed spaces. Proper examples are also illustrated to prove the instabilities for control cases.
-
Ulam Stabilities of Multiplicative Inverse Type Novemdecic and Vigintic Functional Equations in Intuitionistic Fuzzy Normed Spaces
Multiplicative Inverse Functional Equations, 2020Co-Authors: B. V. Senthil Kumar, Hemen DuttaAbstract:This chapter is devoted to study various classical stability results of Multiplicative Inverse novemdecic and vigintic functional equations in intuitionistic fuzzy normed spaces and also counter-examples to disprove the validity of stability results for singular cases.
-
Classical Approximations of Multiplicative Inverse Type Septendecic and Octadecic Functional Equations in Quasi-\(\beta \)-normed Spaces
Multiplicative Inverse Functional Equations, 2020Co-Authors: B. V. Senthil Kumar, Hemen DuttaAbstract:This chapter contains the classical investigation of various fundamental stability results of Multiplicative Inverse septendecic and octadecic functional equations in quasi-\(\beta \)-normed spaces using fixed point technique and also includes two proper examples to disprove stability results for control cases.
B. V. Senthil Kumar - One of the best experts on this subject based on the ideXlab platform.
-
Classical stabilities of Multiplicative Inverse difference and adjoint functional equations
Advances in Difference Equations, 2020Co-Authors: B. V. Senthil Kumar, Khalifa Al-shaqsi, Hemen DuttaAbstract:The aim of this present article is to investigate various classical stability results of the Multiplicative Inverse difference and adjoint functional equations $$ m_{d} \biggl(\frac{rs}{r+s} \biggr)-m_{d} \biggl( \frac{2rs}{r+s} \biggr)= \frac{1}{2} \bigl[m_{d}(r)+m_{d}(s) \bigr] $$ and $$ m_{a} \biggl(\frac{rs}{r+s} \biggr)+m_{a} \biggl( \frac{2rs}{r+s} \biggr)= \frac{3}{2} \bigl[m_{a}(r)+m_{a}(s) \bigr] $$ in the framework of non-zero real numbers. A proper counter-example is illustrated to prove the failure of the stability results for control cases. The relevance of these functional equations in optics is also discussed.
-
Estimation of Inexact Multiplicative Inverse Type Quindecic and Sexdecic Functional Equations in Felbin’s Type Fuzzy Normed Spaces
Multiplicative Inverse Functional Equations, 2020Co-Authors: B. V. Senthil Kumar, Hemen DuttaAbstract:This chapter is devoted to demonstrate the validation of various stabilities of Multiplicative Inverse quindecic and Multiplicative Inverse sexdecic functional equations via fixed point technique in the framework of Felbin’s type fuzzy normed spaces. Proper illustrations are presented to disprove the stability results for singular cases.
-
Inexact Solution of Multiplicative Inverse Type Trevigintic and Quottuorvigintic Functional Equations in Matrix Normed Spaces
Multiplicative Inverse Functional Equations, 2020Co-Authors: B. V. Senthil Kumar, Hemen DuttaAbstract:In this chapter, an inexact solution near to the exact solution of a Multiplicative Inverse trevigintic and quottuorvigintic functional equations are achieved in the sense of Ulam stability hypothesis in matrix normed spaces. Proper examples are also illustrated to prove the instabilities for control cases.
-
Ulam Stabilities of Multiplicative Inverse Type Novemdecic and Vigintic Functional Equations in Intuitionistic Fuzzy Normed Spaces
Multiplicative Inverse Functional Equations, 2020Co-Authors: B. V. Senthil Kumar, Hemen DuttaAbstract:This chapter is devoted to study various classical stability results of Multiplicative Inverse novemdecic and vigintic functional equations in intuitionistic fuzzy normed spaces and also counter-examples to disprove the validity of stability results for singular cases.
-
Classical Approximations of Multiplicative Inverse Type Septendecic and Octadecic Functional Equations in Quasi-\(\beta \)-normed Spaces
Multiplicative Inverse Functional Equations, 2020Co-Authors: B. V. Senthil Kumar, Hemen DuttaAbstract:This chapter contains the classical investigation of various fundamental stability results of Multiplicative Inverse septendecic and octadecic functional equations in quasi-\(\beta \)-normed spaces using fixed point technique and also includes two proper examples to disprove stability results for control cases.
P. Anuradha Kameswari - One of the best experts on this subject based on the ideXlab platform.
-
an attack bound for small Multiplicative Inverse of φ n mod e with a composed prime sum p q using sublattice based techniques
Cryptography, 2018Co-Authors: P. Anuradha Kameswari, Lambadi JyotsnaAbstract:In this paper, we gave an attack on RSA (Rivest–Shamir–Adleman) Cryptosystem when φ ( N ) has small Multiplicative Inverse modulo e and the prime sum p + q is of the form p + q = 2 n k 0 + k 1 , where n is a given positive integer and k 0 and k 1 are two suitably small unknown integers using sublattice reduction techniques and Coppersmith’s methods for finding small roots of modular polynomial equations. When we compare this method with an approach using lattice based techniques, this procedure slightly improves the bound and reduces the lattice dimension. Employing the previous tools, we provide a new attack bound for the deciphering exponent when the prime sum p + q = 2 n k 0 + k 1 and performed an analysis with Boneh and Durfee’s deciphering exponent bound for appropriately small k 0 and k 1 .
-
An Attack Bound for Small Multiplicative Inverse of φ(N) mod e with a Composed Prime Sum p + q Using Sublattice Based Techniques
Cryptography, 2018Co-Authors: P. Anuradha Kameswari, Lambadi JyotsnaAbstract:In this paper, we gave an attack on RSA (Rivest–Shamir–Adleman) Cryptosystem when φ ( N ) has small Multiplicative Inverse modulo e and the prime sum p + q is of the form p + q = 2 n k 0 + k 1 , where n is a given positive integer and k 0 and k 1 are two suitably small unknown integers using sublattice reduction techniques and Coppersmith’s methods for finding small roots of modular polynomial equations. When we compare this method with an approach using lattice based techniques, this procedure slightly improves the bound and reduces the lattice dimension. Employing the previous tools, we provide a new attack bound for the deciphering exponent when the prime sum p + q = 2 n k 0 + k 1 and performed an analysis with Boneh and Durfee’s deciphering exponent bound for appropriately small k 0 and k 1 .
-
Cryptanalysis of RSA with Small Multiplicative Inverse of (p - 1) or (q - 1) Modulo e
2018Co-Authors: P. Anuradha KameswariAbstract:In this paper, we mount an attack on RSA by using lattice based techniques implemented in the case when p - 1 or q - 1 have small Multiplicative Inverse less than or equal to N δ modulo the public encryption exponent e , for some small δ and described the attack bounds for δ.
Daniel Bergh - One of the best experts on this subject based on the ideXlab platform.
-
Motivic classes of some classifying stacks
Journal of the London Mathematical Society, 2015Co-Authors: Daniel BerghAbstract:We prove that the class of the classifying stack BPGL(n) is the Multiplicative Inverse of the class of the projective linear group PGL(n) in the Grothendieck ring of stacks K-0(Stack(k)) for n = 2 ...
Lambadi Jyotsna - One of the best experts on this subject based on the ideXlab platform.
-
An Attack Bound for Small Multiplicative Inverse of φ(N) mod e with a Composed Prime Sum p + q Using Sublattice Based Techniques
Cryptography, 2018Co-Authors: P. Anuradha Kameswari, Lambadi JyotsnaAbstract:In this paper, we gave an attack on RSA (Rivest–Shamir–Adleman) Cryptosystem when φ ( N ) has small Multiplicative Inverse modulo e and the prime sum p + q is of the form p + q = 2 n k 0 + k 1 , where n is a given positive integer and k 0 and k 1 are two suitably small unknown integers using sublattice reduction techniques and Coppersmith’s methods for finding small roots of modular polynomial equations. When we compare this method with an approach using lattice based techniques, this procedure slightly improves the bound and reduces the lattice dimension. Employing the previous tools, we provide a new attack bound for the deciphering exponent when the prime sum p + q = 2 n k 0 + k 1 and performed an analysis with Boneh and Durfee’s deciphering exponent bound for appropriately small k 0 and k 1 .
-
an attack bound for small Multiplicative Inverse of φ n mod e with a composed prime sum p q using sublattice based techniques
Cryptography, 2018Co-Authors: P. Anuradha Kameswari, Lambadi JyotsnaAbstract:In this paper, we gave an attack on RSA (Rivest–Shamir–Adleman) Cryptosystem when φ ( N ) has small Multiplicative Inverse modulo e and the prime sum p + q is of the form p + q = 2 n k 0 + k 1 , where n is a given positive integer and k 0 and k 1 are two suitably small unknown integers using sublattice reduction techniques and Coppersmith’s methods for finding small roots of modular polynomial equations. When we compare this method with an approach using lattice based techniques, this procedure slightly improves the bound and reduces the lattice dimension. Employing the previous tools, we provide a new attack bound for the deciphering exponent when the prime sum p + q = 2 n k 0 + k 1 and performed an analysis with Boneh and Durfee’s deciphering exponent bound for appropriately small k 0 and k 1 .
