vtcode_auth/
pkce.rs

1//! PKCE (Proof Key for Code Exchange) utilities for OAuth 2.0.
2//!
3//! Implements RFC 7636 for secure OAuth flows without client secrets.
4//! Uses SHA-256 (S256) code challenge method as recommended by the spec.
5
6use anyhow::{Context, Result};
7use base64::{Engine, engine::general_purpose::URL_SAFE_NO_PAD};
8use ring::rand::{SecureRandom, SystemRandom};
9use sha2::{Digest, Sha256};
10use std::fmt;
11
12/// PKCE code verifier length (43-128 characters per RFC 7636)
13const CODE_VERIFIER_LENGTH: usize = 64;
14
15/// Characters allowed in code verifier (unreserved URI characters)
16const CODE_VERIFIER_CHARSET: &[u8] = b"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-._~";
17
18/// PKCE challenge pair containing verifier and challenge strings.
19///
20/// Custom `Debug` redacts the `code_verifier` — it is a secret that must
21/// never leave the client. The `code_challenge` and method are safe to
22/// display (they are sent to the authorization server in the URL).
23#[derive(Clone)]
24pub struct PkceChallenge {
25    /// The code verifier (random string, kept secret by client)
26    pub(crate) code_verifier: String,
27    /// The code challenge (SHA-256 hash of verifier, sent to authorization server)
28    pub(crate) code_challenge: String,
29    /// The challenge method (always "S256" for SHA-256)
30    pub(crate) code_challenge_method: String,
31}
32
33impl fmt::Debug for PkceChallenge {
34    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
35        f.debug_struct("PkceChallenge")
36            .field("code_verifier", &"<redacted>")
37            .field("code_challenge", &self.code_challenge)
38            .field("code_challenge_method", &self.code_challenge_method)
39            .finish()
40    }
41}
42
43impl PkceChallenge {
44    /// Create a new PKCE challenge from a code verifier.
45    fn from_verifier(code_verifier: String) -> Result<Self> {
46        let code_challenge = compute_s256_challenge(&code_verifier)?;
47        Ok(Self {
48            code_verifier,
49            code_challenge,
50            code_challenge_method: "S256".to_string(),
51        })
52    }
53}
54
55/// Generate a cryptographically secure PKCE challenge pair.
56///
57/// This function generates a random code verifier and computes
58/// the corresponding S256 code challenge.
59///
60/// # Example
61/// ```
62/// use vtcode_auth::generate_pkce_challenge;
63///
64/// let challenge = generate_pkce_challenge().unwrap();
65/// // code_verifier is a secret — never print or log it.
66/// assert!(!challenge.code_challenge.is_empty());
67/// ```
68pub fn generate_pkce_challenge() -> Result<PkceChallenge> {
69    let code_verifier = generate_code_verifier()?;
70    PkceChallenge::from_verifier(code_verifier)
71}
72
73/// Generate a cryptographically random code verifier per RFC 7636 §4.1.
74///
75/// Uses `ring::rand::SystemRandom` (backed by the OS CSPRNG) instead of a
76/// user-space PRNG to ensure ≥128 bits of entropy as required by the spec.
77fn generate_code_verifier() -> Result<String> {
78    let rng = SystemRandom::new();
79    let charset_len = u8::try_from(CODE_VERIFIER_CHARSET.len()).context("PKCE verifier alphabet is too large")?;
80    let max_valid =
81        u8::try_from(256u16 - 256u16 % u16::from(charset_len)).context("PKCE verifier rejection range is invalid")?;
82    let mut verifier = String::with_capacity(CODE_VERIFIER_LENGTH);
83    let mut buf = [0u8; 1];
84
85    while verifier.len() < CODE_VERIFIER_LENGTH {
86        rng.fill(&mut buf)
87            .map_err(|_| anyhow::anyhow!("failed to read from OS random source"))?;
88        // Rejection sampling to avoid modulo bias.
89        if buf[0] < max_valid {
90            let idx = usize::from(buf[0] % charset_len);
91            if let Some(&character) = CODE_VERIFIER_CHARSET.get(idx) {
92                verifier.push(char::from(character));
93            }
94        }
95    }
96
97    Ok(verifier)
98}
99
100/// Compute S256 code challenge from a code verifier.
101///
102/// S256 = BASE64URL(SHA256(code_verifier))
103fn compute_s256_challenge(code_verifier: &str) -> Result<String> {
104    let mut hasher = Sha256::new();
105    hasher.update(code_verifier.as_bytes());
106    let hash = hasher.finalize();
107
108    Ok(URL_SAFE_NO_PAD.encode(hash))
109}
110
111#[cfg(test)]
112mod tests {
113    use super::*;
114
115    #[test]
116    fn test_generate_pkce_challenge() {
117        let challenge = generate_pkce_challenge().unwrap();
118
119        // Verify code verifier length
120        assert_eq!(challenge.code_verifier.len(), CODE_VERIFIER_LENGTH);
121
122        // Verify all characters are in allowed charset
123        for c in challenge.code_verifier.chars() {
124            assert!(CODE_VERIFIER_CHARSET.contains(&(c as u8)), "Invalid character in verifier: {c}");
125        }
126
127        // Verify challenge method
128        assert_eq!(challenge.code_challenge_method, "S256");
129
130        // Verify challenge is valid base64url (43 chars for SHA-256)
131        assert_eq!(challenge.code_challenge.len(), 43);
132    }
133
134    #[test]
135    fn test_deterministic_challenge() {
136        // Same verifier should produce same challenge
137        let verifier = "test_verifier_string_for_deterministic_test";
138        let challenge1 = PkceChallenge::from_verifier(verifier.to_string()).unwrap();
139        let challenge2 = PkceChallenge::from_verifier(verifier.to_string()).unwrap();
140
141        assert_eq!(challenge1.code_challenge, challenge2.code_challenge);
142    }
143
144    #[test]
145    fn test_unique_verifiers() {
146        // Multiple calls should produce different verifiers
147        let c1 = generate_pkce_challenge().unwrap();
148        let c2 = generate_pkce_challenge().unwrap();
149
150        assert_ne!(c1.code_verifier, c2.code_verifier);
151    }
152}
vtcode_auth/pkce.rs

vtcode_auth/
pkce.rs
