Dimitrios Poulakis

Orcid: 0000-0001-7954-4796

According to our database1, Dimitrios Poulakis authored at least 22 papers between 2000 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Attacking (EC)DSA scheme with ephemeral keys sharing specific bits.
Theor. Comput. Sci., 2024

Special issue: Selected papers of the 9th International Conference on Algebraic Informatics, CAI 2022.
Inf. Comput., 2024

2022
Quantum Key Distribution: Basic Protocols and Threats.
Proceedings of the 26th Pan-Hellenic Conference on Informatics, 2022

2021
Attacking (EC)DSA With Partially Known Multiples of Nonces.
IACR Cryptol. ePrint Arch., 2021

2019
An Attack on Small Private Keys of RSA Based on Euclidean Algorithm.
IACR Cryptol. ePrint Arch., 2019

Enhancing an Attack to DSA Schemes.
Proceedings of the Algebraic Informatics - 8th International Conference, 2019

2016
New lattice attacks on DSA schemes.
J. Math. Cryptol., 2016

2013
Lattice Attacks on DSA Schemes Based on Lagrange's Algorithm.
Proceedings of the Algebraic Informatics - 5th International Conference, 2013

2012
A Digital Signature Scheme for Long-Term Security.
IACR Cryptol. ePrint Arch., 2012

2011
Solving genus zero Diophantine equations over number fields.
J. Symb. Comput., 2011

Efficient Algorithms for the Basis of Finite Abelian Groups.
Discret. Math. Algorithms Appl., 2011

Erratum to: A variant of Digital Signature Algorithm.
Des. Codes Cryptogr., 2011

Some lattice attacks on DSA and ECDSA.
Appl. Algebra Eng. Commun. Comput., 2011

Linear Time Algorithms for the Basis of Abelian Groups.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

An Algorithm for Computing a Basis of a Finite Abelian Group.
Proceedings of the Algebraic Informatics - 4th International Conference, 2011

2009
Some Lattices Attacks on DSA and ECDSA.
IACR Cryptol. ePrint Arch., 2009

A variant of Digital Signature Algorithm.
Des. Codes Cryptogr., 2009

Solving Norm Form Equations over Number Fields.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

2006
Practical solution of the Diophantine equation y<sup>2</sup> = x(x+2<sup>a</sup>p<sup>b</sup>)(x-2<sup>a</sup>p<sup>b</sup>).
Math. Comput., 2006

2003
On the distribution of integer points of rational curves.
Period. Math. Hung., 2003

2002
Solving Genus Zero Diophantine Equations with at Most Two Infinite Valuations.
J. Symb. Comput., 2002

2000
On the Practical Solution of Genus Zero Diophantine Equations.
J. Symb. Comput., 2000


  Loading...