Solving linear Diophantine equation mn^2x + qm^2y = pm^2n^3 by row operation on matrix

2014 ◽  
Vol 8 ◽  
pp. 571-575
Author(s):  
P. Haarsa
2019 ◽  
Vol 531 ◽  
pp. 125-140
Author(s):  
Pedro A. García-Sánchez ◽  
Ulrich Krause ◽  
David Llena

1981 ◽  
Vol 88 (3) ◽  
pp. 200 ◽  
Author(s):  
Stanley Kertzner

2021 ◽  
Vol 10 (6) ◽  
pp. 2799-2806
Author(s):  
P. Anuradha Kameswari ◽  
S.S. Sriniasarao ◽  
A. Belay

In this chapter we propose a Key exchange protocol based on a random solution of linear Diophantine equation in n variables, where the considered linear Diophantine equation satisfies the condition for existence of infinitely many solutions. Also the crypt analysis of the protocol is analysed.


Sign in / Sign up

Export Citation Format

Share Document