Paper Title
Improved Trial Division Algorithm by Lagrange’s Interpolation Function
Authors
Maloth Bhavsingh, M. Sri Lakshmi, Dr. S. Prem Kumar, N. Parashuram
Abstract
Nowadays data communication over the internetgrowths the security risk on the side of receiver and transmitter. To reduce risk level, cryptography technique has been used which is based on aprivate and public key in disquiet of endorsement. The process of encryption and decryption improved the capacity of data security. Asymmetric cryptography technique provides renowned RSA public key cryptography technique. The success story of RSA algorithm depends on the prime factor. For the estimation of theprime factor used various mathematical functions. In this paper,Lagrange’s interpolation derivation for the estimation of aprime factoris used. The estimated prime factor is very complex and reduces the complexity of prime factor.
Keywords
public cryptography, RSA, factor, trial division, Lagrange’s Interpolation
Citation/Export
MLA
Maloth Bhavsingh, M. Sri Lakshmi, Dr. S. Prem Kumar, N. Parashuram, “Improved Trial Division Algorithm by Lagrange’s Interpolation Function”, May 17 Volume 5 Issue 5 , International Journal on Recent and Innovation Trends in Computing and Communication (IJRITCC), ISSN: 2321-8169, PP: 1227 - 1231
APA
Maloth Bhavsingh, M. Sri Lakshmi, Dr. S. Prem Kumar, N. Parashuram, May 17 Volume 5 Issue 5, “Improved Trial Division Algorithm by Lagrange’s Interpolation Function”, International Journal on Recent and Innovation Trends in Computing and Communication (IJRITCC), ISSN: 2321-8169, PP: 1227 - 1231

© All Rights Reserved

16 tayangan

Paper Title
Improved Trial Division Algorithm by Lagrange’s Interpolation Function
Authors
Maloth Bhavsingh, M. Sri Lakshmi, Dr. S. Prem Kumar, N. Parashuram
Abstract
Nowadays data communication over the internetgrowths the security risk on the side of receiver and transmitter. To reduce risk level, cryptography technique has been used which is based on aprivate and public key in disquiet of endorsement. The process of encryption and decryption improved the capacity of data security. Asymmetric cryptography technique provides renowned RSA public key cryptography technique. The success story of RSA algorithm depends on the prime factor. For the estimation of theprime factor used various mathematical functions. In this paper,Lagrange’s interpolation derivation for the estimation of aprime factoris used. The estimated prime factor is very complex and reduces the complexity of prime factor.
Keywords
public cryptography, RSA, factor, trial division, Lagrange’s Interpolation
Citation/Export
MLA
Maloth Bhavsingh, M. Sri Lakshmi, Dr. S. Prem Kumar, N. Parashuram, “Improved Trial Division Algorithm by Lagrange’s Interpolation Function”, May 17 Volume 5 Issue 5 , International Journal on Recent and Innovation Trends in Computing and Communication (IJRITCC), ISSN: 2321-8169, PP: 1227 - 1231
APA
Maloth Bhavsingh, M. Sri Lakshmi, Dr. S. Prem Kumar, N. Parashuram, May 17 Volume 5 Issue 5, “Improved Trial Division Algorithm by Lagrange’s Interpolation Function”, International Journal on Recent and Innovation Trends in Computing and Communication (IJRITCC), ISSN: 2321-8169, PP: 1227 - 1231

© All Rights Reserved

- Enhanced Secure Algorithm for Message Communication
- Role of Cryptography in Securing Ecommerce
- network security ppt
- Web & Php Mag
- Ensuring the Data Integrity and Confidentiality in Cloud Storage Using Hash Function and TPA
- Fault Analysis Attacks and Its Countermeasure using Elliptic Curve Cryptography
- Security Plus QA
- Notes on Public Key Cryptography and Primality Testing
- Encryption Quality Analysis and Security Evaluation of CAST-128 Algorithm and its Modified Version using Digital Images
- McElice Key
- SNIAsecbookletfinal
- Java Secure Socket
- An Efficient Solution for Privacypreserving, Secure Remote Access to Sensitive Data
- Secure and efficient management of confidential data in the decentralized disruption-tolerant militery networks
- Cert
- First Level Report
- 334 Recitation7 RSA
- IJCIS 020406
- IJETTCS-2012-12-26-068
- 79_AES

Anda di halaman 1dari 5

_______________________________________________________________________________________________

*

Maloth Bhavsingh, 1M. Sri Lakshmi, 2Dr. S. Prem Kumar,3N. Parashuram

1,3

Assistant Professor, Dept. of CSE, G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh

2

Prof &HOD, Dept of CSE, G Pullaiah College of Engineering and Technology, Kurnool.Andhra Pradesh.

Abstract- Nowadays data communication over the internetgrowths the security risk on the side of receiver and transmitter. To reduce risk level,

cryptography technique has been used which is based on aprivate and public key in disquiet of endorsement. The process of encryption and

decryption improved the capacity of data security. Asymmetric cryptography technique provides renowned RSA public key cryptography

technique. The success story of RSA algorithm depends on the prime factor. For the estimation of theprime factor used various mathematical

functions. In this paper,Lagranges interpolation derivation for the estimation of aprime factoris used. The estimated prime factor is very

complex and reduces the complexity of prime factor.

__________________________________________________*****_________________________________________________

Public key cryptography is one of the applications that are factors of very large numbers. It has not been demonstrated

valuable in sending information via insecure channels that factoring requirement is difficult, and their residues a

algorithm is a public key encryption algorithm. RSA has chance that a rapid and easy factoring method might be

become most popular cryptosystem in the world because of exposed [6]. The private key is period coupled and it is

its simplicity. According to number theory, it is easy to finds mathematically related to the corresponding public key.

two big prime number, but the factorization of the product Hence, it is repetitively probable to attack a public-key

of two big prime numbers is very difficult task. The system by originating the private key commencing the

difficulty of computing the roots N, where N is the product public key. For occurrence, specific Public-key

of two large unknown primes, it is widely believed to be cryptosystems are considered such that deriving the private

secure for large enough N. Since RSA can also be broken by key from the public key involves the attacker to factor a

factoring N, the security of RSA is often based on the large number, therefore, it is computationally infeasible to

integer factorization problem [1]. The integer factorization implement the derivation. This is principally the significant

problem is a well-known topic of research within both idea of the RSA public-key cryptosystem [5]. RSA

academia and industry. It consists of finding the prime operations are secluded exponentiations of huge whole

factors for any given large modulus Thereliability and numbers with a common size of 512 to 2048 bits. RSA

security of data over the internet aremain issue. For the encryption creates a figure content C from a message M in

reliability and authentication cryptography technique is light of a secluded exponentiation = Me mod n.

used. The cryptography techniques give the process of Unscrambling recovers the message by computing = Cd mod

encryption and decryption. The process of encryption and n. Among the few systems that can be utilized to quicken

decryption uses the symmetric and asymmetric technique. RSA, they extraordinarily centered around those appropriate

The Asymmetric technique used RSA algorithm. The under the requirements of 8-bit gadgets.

Strength of RSA algorithms depends on the processing of

factorization and complexity of factor. For the minimization 2. RELATED WORK

of the complexity of factorization Lagranges interpolation In 1978, RSA developed a public key cryptosystem thatis

function is used to enhance the capacity of RSA based on the difficulty of integer factoring. The RSApublic

factorization. Factorization is a reverse process of key encryption scheme is the first example of aprovable

multiplication. It is the act of splitting an integer into a set of secure public key encryption scheme againstchosen message

smaller integers (factors) which, when multiplied collected, chosen attacks [5].

1227

IJRITCC | May 2017, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 5 Issue: 5 1227 - 1231

_______________________________________________________________________________________________

Key generation algorithm, to generate the keys entity A The generation of RSA factor is very critical task [2]. For

must do the following: the production of factor different mathematical functions are

a. Randomly and secretly select two large prime numbers p used.The mathematical function generates strong pairs of (P,

and q both are prime but p! =q. Q). The P and Q are prime factor of given number. The

b. Compute the N = p*q. main weakness static password is that if it is simple, it can

c. Compute Euler Totient function phi (N) = (p-1) (q-1). be easily attacked by Trojan attacks, password attacks, or by

d. Select random integer e, 1<e<N simply guessing it. A static password is a usual way that a

e. Compute the secret exponent d, 1 < d < phi, such that ed user authenticates when logging in to a service is needed.

=1(mod (phi)) The password is usually a secret word or phrase picked by

f. The public key is (N, e) and the private key is (N, d). the user and used together with the user's username. It can

Keep all the values d, p, q and phi secret. N is known as the be used when logging into your personal computer, an e-

modulus. mail system, an online community, etc. Cloud computing

e is known as the public exponent or encryption exponent or security should be very secure and reliable otherwise the

just the exponent. d is known as the secret exponent or people confidential information will get compromised.

decryption exponent People Still Using the same passwords to access the

different accounts on the cloud which is very insecure and

An algorithm for attacking RSA scheme based on the third party cloud computing service providers are not

knowing public key (e, n) work efficiently if the decryption providing proper security about static passwords. This is the

key d is small. This algorithm divide Fermat Factorization big disadvantage of the cloud computing environment

method in two part first is, factorize number with respect because the static password can be attacked by unauthorized

floor function of square root of N, to get maximum factors user and account information can be easily taken by hackers.

that are neighbor to the (N) , second is if don't get positive Some problems are given below

integer value of square root , then sequence between 1. Length of factor

floor(N) to N. An innovative technique has been 2. Factional part of factor

introduced, to factorize RSA modulus N. This was 3. Strength of factor

established on Trial Division method and customs simple 4. Prime factorization

arithmetic operations for finding the factors which are 5. Computational complexity

nearby to N.

1228

IJRITCC | May 2017, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 5 Issue: 5 1227 - 1231

_______________________________________________________________________________________________

4. PROPOSED METHOD AND MODEL were tested on Intel core-i5 PC 2.50 GHz with 4 GB RAM

In this section, we will discuss the improved algorithm of under Microsoft Windows-8.1 Pro 32-bit using Dot Net. The

RSA factor generation using the interpolation derivatives original and modified Factorization method implementations

and algorithm. The interpolation derivates derived the input are shown in Fig 2.

message regarding data and create a variable size matrix for

the processing of input data of through Lagranges

interpolation and generate P and Q Prime Factor.

1 Read x, n

2 for i=1 to (n+1) in steps of 1 do Read xi, fi endfor

//The above statement reads xis and the corresponding

values of fis.

3 sum0

4 for i=1 to (n+1) in steps of 1 do

5 prodfunc1

6 for j=1 to (n+1) in steps of 1 do

7 If (ji) then

Prodfuncprodfunc (x-xj)/(xi-xj)

endfor Figure 2: the TDF method button of modified trial division

8 sumsum+fi prodfunc factor for RSA algorithm

//sum is the value of f at x

endfor

9 Write x, sum

10 Stop

Input: Real Positive integer number N

Output: Factors of N

1. define the rand function for the coordinate

generation of point x1,x2,x3,x4..xn

2. enter the positive number

3. if N<1 then goto step 2

4. Rand(N) // random point creation for coordinate

system

5. Sum of point p coordinate in alternate axial Figure 3: KNJ method button of modified trial division

6. If P divided N then factor for RSA algorithm

7. Return P,N/p

8. End if

The generation and security strength of RSA key

cryptography depend on the estimation of key factor value.

If the key factor value is the week it is easily breakable by

third party and hacker. For the enhancement of key factor,

various authors used various multiplication and interpolation

derivate. The Modified Trial Division Algorithm Using

Lagranges Interpolation, gives better results as compared

the Trial-Division method using KNJ Factorization method.

The Lagranges Interpolation Factorization method provides

Figure 4: method button of modified trial division factor for

efficient results with the minimum number of time. Hence it

RSA algorithm

reduces the time complexity and increases the speed of the

computation. The Trial-Division,KNJ, and LIF algorithm

1229

IJRITCC | May 2017, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 5 Issue: 5 1227 - 1231

_______________________________________________________________________________________________

6. RESULT some of the results of this algorithm with Trial-Division and

There are many factoring algorithms that are developed in KNJ.

the research area of RSA, but we equated and compared

Table 1: Result table shows the number value of N, a factor of N and taken time using TDF, KNJ, LIF Methods in our Modified

Trial Division Algorithm, using Lagrange's Interpolation Method to factorize RSA Public Key Encryption.

Execution in Execution Execution in

TDF in KNJ LIF

55 11*5

00.0037423 0.0041254 00.0000008

1943 67*29

00.0010952 0.0048015 00.0000008

998299 1213*823

00.0033018 0.0047859 00.0000004

85928201 9817*8753

00.0946525 0.0043368 00.0000004

1323172573 47591*27803

01.8576520 0.0047592 00.0000004

Even though the number of digits in N is increased; the better prime value and minimum period. In future increase,

proposed algorithm takes less time to compute the factors of the duration of integer and reduces the time complexity.

N as compared to the Modified Trial Division Algorithm

using KNJ Factorization method. Hence, the time execution REFERENCES

in the Lagranges Factorization method is very less as [1] AL-Hamami AL-Ani, Technology of information

security and protection systems, ISBN 978-9957-11-697-

compare to Modified Trial Division method. Therefore

2, pp.173 - 223, Dar Wael , Jordan. 2007

Lagranges Factorization method gives better results,

[2] NidhiLal, AnuragPrakash Singh and Shishupal Kumar

increases thespeed of computation and provides anefficient Modified Trial Division Algorithm Using KNJ-

way of factorization. Factorization Method to Factorize RSA Public Key

Encryption, IEEE, 2014, Pp 1-4.

7. CONCLUSION AND FUTURE WORK [3] Nils Gura, Arun Patel, Arvinderpal Wander, Hans Eberle

The proposed interpolation algorithm reduces the time and Sheueling Chang Shantz Comparing Elliptic Curve

complexity and space complexity in point factor Cryptography and RSA on 8-bit CPUs, Springer, 2014,

interpolation. The main concept is to check only those Pp 119-132.

factors which are odd, as well as those, are prime numbers. [4] Alese, B. K., Philemon E. D. and Falaki, S.

The proposed Lagranges Interpolation Factorization O.Comparative Analysis of Public-Key Encryption

Schemes, International Journal of Engineering and

algorithm works very efficiently on those factors that are

Technology, 2012, Pp 1552-1568.

nearby and very closest to N. The Lagranges interpolation

[5] Kamran Ali, Muhammad AsadLodhi and Ovais bin

enhanced the capacity of prime factorization of RSA Usman FPGA Implementation of RSA Encryption

algorithm. The Lagranges interpolation used the point System, LUMS, 2012. Pp 2-9.

distribution function for the estimation of aprime number. If [6] Tal Malkin, Isamu Teranishi and Moti Yung Ecient

the distribution function length is increased, the complexity Circuit-Size Independent Public Key Encryption with

of time is also increased. The 12-digit number factor gives KDM Security, 2013, Pp 1-20.

1230

IJRITCC | May 2017, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 5 Issue: 5 1227 - 1231

_______________________________________________________________________________________________

[7] Joppe W. Bos, J. Alex Halderman, Nadia Heninger,

Jonathan Moore, Michael Naehrig and Eric Wustrow

Elliptic Curve Cryptography in Practice, Springer,

2014, Pp 157-175.

[8] Mohamed HamdyEldefrawy, Muhammad KhurramKhan

and KhaledAlghathbar A Key Agreement Algorithm

with Rekeying for Wireless Sensor Networks using

Public Key Cryptography, IEEE, 2010, Pp 1-6.

[9] Jesus Ayuso, Leandro Marin, Antonio J. Jara and

Antonio F. GomezSkarmeta Optimization of Public

Key Cryptography (RSA and ECC) for 16-bits Devices

based on 6LoWPAN, International Workshop on the

Security of the Internet of Things, 2010, Pp 1-8.

[10] Hoeteck Wee Public Key Encryption AgainstRelated

Key Attacks, NSF CAREER, 2011, Pp 1-18.

[11] Michael Hutter and Erich Wenger Fast Multi-precision

Multiplication for Public-Key Cryptography on

Embedded Microprocessors, International Association

for Cryptologic Research, 2011, Pp 459-474.

[12] Samuel Neves and Filipe Araujo On the Performance of

GPU Public-Key Cryptography, IEEE, 2011, Pp 133-

140.

[13] DhananjayPugila, Harsh Chitrala, SalpeshLunawat and

P.M.Durai Raj Vincent An efficient encryption

algorithm based on public keycryptography, IJET,

2013, Pp 3064-3067.

[14] Thomas Poppelmann and Tim Guneysu Towards

Practical Lattice-Based Public-Key Encryption on

Recongurable Hardware, Springer, 2014, Pp 68-85.

[15] B.Persis Urbana Ivy and PurshotamMandiwa. Mukesh

Kumar A modified RSA cryptosystem based on n

prime numbers, IEEE, 2013, Pp 1-4.

1231

IJRITCC | May 2017, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

- Enhanced Secure Algorithm for Message CommunicationDiunggah olehAIRCC - IJNSA
- Role of Cryptography in Securing EcommerceDiunggah olehGanggah Devi Murugaya
- network security pptDiunggah olehPreeti Reddy
- Web & Php MagDiunggah olehdand1234
- Ensuring the Data Integrity and Confidentiality in Cloud Storage Using Hash Function and TPADiunggah olehEditor IJRITCC
- Fault Analysis Attacks and Its Countermeasure using Elliptic Curve CryptographyDiunggah olehijcsis
- Security Plus QADiunggah olehstakoff
- Notes on Public Key Cryptography and Primality TestingDiunggah olehWarren Smith QC (Quantum Cryptanalyst)
- Encryption Quality Analysis and Security Evaluation of CAST-128 Algorithm and its Modified Version using Digital ImagesDiunggah olehAIRCC - IJNSA
- McElice KeyDiunggah olehCasandra Edwards
- SNIAsecbookletfinalDiunggah olehSathish Sagar
- Java Secure SocketDiunggah olehAnkur Gupta
- An Efficient Solution for Privacypreserving, Secure Remote Access to Sensitive DataDiunggah olehCS & IT
- Secure and efficient management of confidential data in the decentralized disruption-tolerant militery networksDiunggah olehtheijes
- CertDiunggah olehchouchou3000
- First Level ReportDiunggah olehsaran
- 334 Recitation7 RSADiunggah olehAntony Ingram
- IJCIS 020406Diunggah olehijcisjournal
- IJETTCS-2012-12-26-068Diunggah olehAnonymous vQrJlEN
- 79_AESDiunggah olehVishal Avhad
- Organizing Engineering Research Papers(8)Diunggah oleh柯泰德 (Ted Knoy)
- Px c 3885510Diunggah olehLoai F Alzouabi
- FINAL1Diunggah olehAnish Kumar
- HOMOMORPHIC AUTHENTICABLE RING SIGNATURE MECHANISM FOR PUBLIC AUDITING ON SHARED DATA IN THE CLOUDDiunggah olehJournal 4 Research
- SelectingCryptographicKeySizesDiunggah olehRing-tailed Lemur
- Important10.1.1.91.2800.pdfDiunggah olehKamau Gabriel
- Hybrid Approach for Providing Security by Using Quantum and Elliptic Curve CryptographyDiunggah olehAnonymous vQrJlEN
- Final Report Inter Mob CommDiunggah olehMounesh Panchal
- 3745Diunggah olehjkkp
- 102Diunggah olehscribdgoutam

- a clustering and associativity analysis based probabilistic method for web page predictionDiunggah olehrahul sharma
- Regression Based Comparative Study for Continuous BP Measurement Using Pulse Transit TimeDiunggah olehEditor IJRITCC
- Channel Estimation Techniques over MIMO-OFDM SystemDiunggah olehEditor IJRITCC
- A Review of Wearable Antenna for Body Area Network ApplicationDiunggah olehEditor IJRITCC
- Safeguarding Data Privacy by Placing Multi-level Access RestrictionsDiunggah olehEditor IJRITCC
- space complexity analysis of rsa and ecc based security algorithms in cloud dataDiunggah olehrahul sharma
- A Review of 2D &3D Image Steganography TechniquesDiunggah olehEditor IJRITCC
- IJRITCC Call for Papers (October 2016 Issue) Citation in Google Scholar Impact Factor 5.837 DOI (CrossRef USA) for each paper, IC Value 5.075Diunggah olehEditor IJRITCC
- Performance Analysis of Image Restoration Techniques at Different NoisesDiunggah olehEditor IJRITCC
- Comparative Analysis of Hybrid Algorithms in Information HidingDiunggah olehEditor IJRITCC
- Importance of Similarity Measures in Effective Web Information RetrievalDiunggah olehEditor IJRITCC
- 7 1534938100_22-08-2018Diunggah olehEditor IJRITCC
- Fuzzy Logic A Soft Computing Approach For E-Learning: A Qualitative ReviewDiunggah olehEditor IJRITCC
- Modeling Heterogeneous Vehicle Routing Problem with Strict Time ScheduleDiunggah olehEditor IJRITCC
- Network Approach based Hindi Numeral RecognitionDiunggah olehEditor IJRITCC
- Efficient Techniques for Image CompressionDiunggah olehEditor IJRITCC
- A Study of Focused Web Crawling TechniquesDiunggah olehEditor IJRITCC
- Prediction of Crop Yield Using LS-SVMDiunggah olehEditor IJRITCC
- Predictive Analysis for Diabetes using TableauDiunggah olehEditor IJRITCC
- Simulation of Vector Controlled Adjustable Speed System of Doubly Fed Induction MachineDiunggah olehEditor IJRITCC
- iTimer - Count On Your TimeDiunggah olehEditor IJRITCC
- Hybrid Algorithm for Enhanced Watermark Security with Robust DetectionDiunggah olehEditor IJRITCC
- 48 1530871571_06-07-2018.pdfDiunggah olehrahul sharma
- IoT and Fingerprint Based Door Looking SystemDiunggah olehEditor IJRITCC
- Kinematic Hardening Parameters Identification with Finite Element Simulation of Low Cycle Fatigue using Genetic Algorithm ApproachDiunggah olehEditor IJRITCC
- image restoration techniques using fusion to remove motion blurDiunggah olehrahul sharma
- a content based region separation and analysis approach for sar image classificationDiunggah olehrahul sharma

- PowerVu Management Keys HackedDiunggah olehAndy Villasanti
- 4.1 Cnse Study GuideDiunggah olehChin Kian Teck
- IOS Security Guide Sept 2014Diunggah olehreddituser
- 1 IntroductionDiunggah olehSomasundaram Krishnan
- Nod 32 SerialDiunggah olehPiero Vas
- criptographyDiunggah olehapi-3746880
- Bahram Hakhamaneshi Project ReportDiunggah olehchieubkhn
- Privileged Access Management Frequently Asked QuestionsDiunggah olehHitachiID
- 01 Introduction to Linux Host SecurityDiunggah olehSimona Marin
- IDEA and BlowfishDiunggah olehRanjit Thakor
- The E-Cheque System SpecificationDiunggah olehnaymyothwin
- Hash Functions Technical ReportDiunggah olehMustafa Alper BALIM
- Cryptanalysis of the EnigmaDiunggah olehyepitsdiana
- easttom_tb_01Diunggah olehTresor Dunia
- VPN Sol GuideDiunggah olehmarioRV
- Survey PaperDiunggah olehAinur Issina
- Chandrasekhar SynopsisDiunggah olehgovind
- CryptanalysisDiunggah olehEdwin Okoampa Boadu
- Indian Cyber Army in India Today - On Exposed Nasty Truth About ISIS SupportersDiunggah olehAnonymous paeLVvL3w
- Bitcoin Key RecoveryDiunggah olehGeña Gonzales
- Cyberoam VPN Client Configuration GuideDiunggah olehcipherm
- Red Hat Update Infrastructure 2.1 Installation Guide en USDiunggah olehAndre Luiz da Silva
- FBI Letter to Senator WydenDiunggah olehSoftpedia
- Cyber Defense Emagazine November 2017Diunggah olehPraveen Mohapatra
- Traditional and Modern Symmetric Key CiphersDiunggah olehryu447
- tk20_oviewDiunggah olehrgb1380
- Web Security for software testingDiunggah olehguruannamalai
- unit-v-info-sec-question-ans-cs1014Diunggah olehN.Vivekananthamoorthy
- Quatrro CRM Pt ReportDiunggah olehdirectneha
- 1783-1443125712Diunggah olehAngəɭOrDeviɭ