File: algorithm.vala

package info (click to toggle)
seahorse 47.0.1-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 13,364 kB
  • sloc: ansic: 16,763; xml: 249; python: 27; makefile: 7
file content (103 lines) | stat: -rw-r--r-- 2,782 bytes parent folder | download | duplicates (5)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
/*
 * Seahorse
 *
 * Copyright (c) 2016 Niels De Graef
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
 * See the GNU General Public License for more details.
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, see
 * <http://www.gnu.org/licenses/>.
 */

/**
 * Enumerates the possible algorithms in which an SSH key can be encrypted.
 * This is also known as the 'type' of a key.
 */
public enum Seahorse.Ssh.Algorithm {
    UNKNOWN,
    RSA,
    DSA,
    ECDSA,
    ED25519;

    /**
     * Returns a (non-localized) string representation.
     *
     * @return A string representation, or null if UNKNOWN.
     */
    public string? to_string() {
        switch(this) {
            case UNKNOWN:
                return "";
            case RSA:
                return "RSA";
            case DSA:
                return "DSA";
            case ECDSA:
                return "ECDSA";
            case ED25519:
                return "ED25519";
            default:
                assert_not_reached ();
        };
    }

    /**
     * Converts a string representation into a Algorithm.
     *
     * @return The algorithm (can be UNKNOWN).
     */
    public static Algorithm from_string(string? type) {
        if (type == null || type == "")
            return UNKNOWN;

        string _type = type.strip().down();
        switch (_type) {
            case "rsa":
                return RSA;
            case "dsa":
            case "dss":
                return DSA;
            case "ecdsa":
                return ECDSA;
            case "ed25519":
                return ED25519;
            default:
                return UNKNOWN;
        }
    }

    /**
     * Tries to make an educated guess for the algorithm type.
     * Basically it just checks if the given string contains the type.
     *
     * @return The guessed algorithm (can be UNKNOWN)
     */
    public static Algorithm guess_from_string(string? str) {
        if (str == null || str == "")
            return UNKNOWN;

        string str_down = str.down();
        if ("rsa" in str_down)
            return RSA;

        if (("dsa" in str_down) || ("dss" in str_down))
            return DSA;

        if ("ecdsa" in str_down)
            return ECDSA;

        if ("ed25519" in str_down)
            return ED25519;

        return UNKNOWN;
    }
}