http://hg.omfa.de/prosody-hg/ en-us spec/util_jwt_spec.lua revision history http://hg.omfa.de/prosody-hg/log/ad4ab01f9b11/spec/util_jwt_spec.lua Matthew Wild <mwild1@gmail.com> Thu, 29 Sep 2022 23:17:42 +0100 http://hg.omfa.de/prosody-hg/log/31a2bd84191d/spec/util_jwt_spec.lua
Except 'none'. Not implementing that one.]]> Matthew Wild <mwild1@gmail.com> Sat, 02 Jul 2022 15:29:04 +0100 http://hg.omfa.de/prosody-hg/log/8e402a2ae1b8/spec/util_jwt_spec.lua
Now we can consistently apply the same tests to every algorithm, instead of
duplicating code.]]> Matthew Wild <mwild1@gmail.com> Sat, 02 Jul 2022 14:22:20 +0100 http://hg.omfa.de/prosody-hg/log/899c057781cd/spec/util_jwt_spec.lua Matthew Wild <mwild1@gmail.com> Sat, 02 Jul 2022 12:36:52 +0100 http://hg.omfa.de/prosody-hg/log/b3d0c1457584/spec/util_jwt_spec.lua Matthew Wild <mwild1@gmail.com> Sat, 02 Jul 2022 12:26:43 +0100 http://hg.omfa.de/prosody-hg/log/27a72982e331/spec/util_jwt_spec.lua
In many cases code will be either signing or verifying. With asymmetric
algorithms it's clearer and more efficient to just state that once, instead of
passing keys (and possibly other parameters) with every sign/verify call.

This also allows earlier validation of the key used.

The previous (HS256-only) sign/verify methods continue to be exposed for
backwards-compatibility.]]> Matthew Wild <mwild1@gmail.com> Fri, 01 Jul 2022 18:51:15 +0100 http://hg.omfa.de/prosody-hg/log/4eee1aaa9405/spec/util_jwt_spec.lua Kim Alvefur <zash@zash.se> Mon, 24 Feb 2020 09:10:28 +0100 http://hg.omfa.de/prosody-hg/log/c4ded3be7cc0/spec/util_jwt_spec.lua Kim Alvefur <zash@zash.se> Mon, 24 Feb 2020 01:24:25 +0100