Complexities on faking one signature

[iry]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA512

Hello everyone!

When an adversary attempts to create someone's GPG signature of a
certain message, there are at least two ways to do so:
1. Computing the private key from the public key of the target and
then using the private key to sign the message;
2. Enumerating the possible signature of that certain message and
using the target's public key to verify if one of the signatures is
correct.

If other conditions are same and the adversary only needs to get the
target's signature of one certain message, will the second approach
easier than the first approach in terms of computing complexity?

I'm really looking forward to the answer and/or further discussion!
Thank you!

Best,
iry
-----BEGIN PGP SIGNATURE-----

iQIcBAEBCgAGBQJY4HjiAAoJEKFLTbxtzdU8d4QP/2UvpLxY3E2lhN3YVwmQnWMO
O/X9svCSsrFLZZU6jskQn0zTTDr05TzYI3xKHOrAocllULMzTHF8Q1X47pUGtdI/
Y2Oa32A387e8bjaSA+iLBuhyfwkRXkNvKy8iwHaG6353i/7hS8EHGugsZYNeXKIv
P7wHfaJFZ/7vj4BD4vQZAiLIU0W3jMslHNvNvp1jHSxyiHnM9o+bhdJd7WsqCD6A
hAaUP1OAffKSjuM85QpmnsOW29SkkCMVDlyrNtDS58eBup2fxv3YCwzBdH53vnhY
tNA5g/KclndmGD5IagacN90hB6cX/LTl55kWDgJdKRqKlMAkhnY4zllWdtM9dcp9
+3NYbWQptxgnfCqVeMLoUew0ioORjDjLulFRHM+X5iNdyanNgCA5H/4wOu4jlb6f
dRK8xnzJ4wzVTQONDHDd9B5xQ1cKy1nqi+aeGpmkMJqFmY87ijd32rseWkTe5uKk
TYRN8je9RQgLmJ7AYlngTEYw8frsMvprX/zLY88pYe99r2Ggc559yxu9zemqcwpv
adWUUbc9ztJybDh4Py7EWSGR/6o2OUAoMlF80petRbDKJbSi/zE/C5HrczKHJkGS
cgnW9CQxbJxkePnB6GbGo6tA5TYhcBzJ+8NaCZCFMonkg4ihPIqTLoIIZe/OGYZ4
GK65uMtyc4w8gRjC6sKl
=OYVh
-----END PGP SIGNATURE-----
-------------- next part --------------
A non-text attachment was scrubbed...
Name: 0x6DCDD53C.asc
Type: application/pgp-keys
Size: 3858 bytes
Desc: not available
URL: </pipermail/attachments/20170402/6dd91d00/attachment.key>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: 0x6DCDD53C.asc.sig
Type: application/pgp-signature
Size: 543 bytes
Desc: not available
URL: </pipermail/attachments/20170402/6dd91d00/attachment.sig>