]> RustyKey

United States of America antony@rustykey.io

SEC COSE post-quantum cryptography isogeny-based cryptography constrained devices IoT security NOTE: This document describes a signature scheme based on an algorithm currently under evaluation in the NIST Post-Quantum Cryptography standardization process. Be aware that the underlying primitive may change as a result of that process. This document specifies the algorithm encodings and representations for the SQIsign digital signature scheme within the CBOR Object Signing and Encryption (COSE) and JSON Object Signing and Encryption (JOSE) frameworks. SQIsign is an isogeny-based post-quantum signature scheme that provides exceptionally compact signature and public key sizes compared to lattice-based alternatives currently under NIST evaluation. The standardization of SQIsign will be helpful to address current infrastructure bottlenecks, specifically the FIDO2 CTAP2 specification used by billions of in-service devices and browser installations. Some deployments of CTAP2-based authenticators enforce limits near 1024 bytes for external key communication, depending on authenticator implementation, transport (USB/NFC/BLE) and message fragmentation support. Some standardized post-quantum signature schemes with larger signature sizes may exceed the message size limits of constrained authenticators, transports or produce surprising and unwanted results further along the authentication ceremony. SQIsign-L1, L2 and L5 signatures are small enough to enable delivery over constrained networks like 802.15.4. This document clarifies that SQIsign does not expose the auxiliary torsion-point information exploited in the SIDH/SIKE attacks. Consequently, the specific attack techniques of Castryck–Decru do not directly apply. However, the scheme remains subject to ongoing cryptanalysis of isogeny-based constructions. By establishing stable COSE and JOSE identifiers, this document ensures the interoperability required for the seamless integration of post-quantum security into high-density, bandwidth-constrained, and legacy-compatible hardware environments. Status information for this document may be found at . Discussion of this document takes place on the COSE Working Group mailing list (), which is archived at . Subscribe at . Source for this draft and an issue tracker can be found at .

Introduction This document registers algorithm identifiers and key type parameters for SQIsign in COSE and JOSE.

Background and Motivation Post-quantum cryptography readiness is critical for constrained devices. As of 2026, while FIDO2/WebAuthn supports various COSE algorithms, some hardware authenticators and platform authenticators (like TPMs) have strict memory/storage constraints, effectively limiting public keys to 1024 bytes or less, hindering the adoption of large-key post-quantum algorithms.

Pressing Need for Smaller PQC Signatures FN-DSA (Falcon) and ML-DSA (Dilithium) have larger signatures that may not fit in constrained environments. The fundamental differences between ML-DSA, FN-DSA, and SQIsign lie in their underlying hard mathematical problems, implementation complexity, and performance trade-offs. FN-DSA (Falcon, NIST alternative) uses NTRU lattices to achieve very small signatures and fast verification, but requires complex floating-point math. Dilithium (NIST primary) is a balanced, high-efficiency lattice scheme using Module-LWE/SIS, easy to implement. SQIsign is a non-lattice, isogeny-based scheme that offers the smallest signature sizes but suffers from significantly slower signature generation where even vI may take seconds to minutes, or longer with WASM implementations for browsers of particular relevance to signatures required for WebAuthn PassKeys . SQIsign is an isogeny-based digital signature scheme participating in NIST's Round 2 Additional Digital Signature Schemes, not yet a NIST standard . Speed comparison (approximate, implementation-dependent): Signing: SQIsign is 100x-1000x slower than ML-DSA Verification: SQIsign is 2x-10x slower than ML-DSA Key Generation: SQIsign is 50x-500x slower than ML-DSA Note: Performance varies significantly based on parameter set and optimization level. WASM implementations may be substantially slower. Table 1 compares representative parameter sets; note that these schemes are at different stages of standardization and evaluation. Algorithm Public Key Size Signature Size PK + Sig < 1024? ML-DSA-44 1,312 bytes 2,420 bytes ❌ ML-DSA-65 1,952 bytes 3,293 bytes ❌ ML-DSA-87 2,592 bytes 4,595 bytes ❌ FN-DSA-512 897 bytes 666 bytes ❌ (1,563 total) FN-DSA-1024 1,793 bytes 1,280 bytes ❌ SQIsign-L1 65 bytes 148 bytes ✅ (213 total) SQIsign-L3 97 bytes 224 bytes ✅ (321 total) SQIsign-L5 129 bytes 292 bytes ✅ (421 total)

Estimated Constrained Device Footprint The total addressable market for SQIsign in constrained devices is estimated at more than 6 billion units. Total Addressable Market: ~6.77 billion devices - Legacy Hardware Security Keys: 120-150 million - Constrained TPMs: ~1.1 billion
- Browser Implementations: ~5 billion - Critical Infrastructure: ~300 million - Other IoT: ~250 million

Device Category Breakdown

Legacy Hardware Security Keys: ~120 - 150 million Security keys in Service: ~120 - 150 million legacy keys in active circulation (Series 5 and older). Some firmware introduced PQC readiness. Some older keys cannot be updated to increase buffer sizes.

Constrained TPMs and Platform Modules: ~1.1 billion Trusted Platform Modules (TPMs) are integrated into PCs and servers, but their WebAuthn implementation often inherits protocol-level constraints. Estimated ~2.5 billion active chips worldwide. Constrained Subset: We estimate ~1.1 billion of these are in older Windows 10/11 or Linux machines where the OS "virtual authenticator" or TPM driver still enforces the 1024-byte message default to maintain backward compatibility with external CTAP1/2 tools.

Browser and Software Implementations: ~5 billion This category refers to the "User-Agent" layer that mediates between the web and the hardware. Global Browser Agents: There are over 5 billion active browser instances across mobile and desktop (Chrome, Safari, Edge, Firefox). Legacy Protocols: Even on modern hardware, browsers often use the FIDO2 CTAP2 specification which, unless explicitly negotiated for larger messages, maintains a 1024-byte default for external key communication.

Critical Infrastructure: ~300 Million includes Energy (electric, nuclear, oil, gas), Water & Wastewater, Transportation Systems, Communications, Government, Emergency Services, Healthcare and Financial Services Industrial/Government: Agencies like the U.S. Department of Defense rely on high-security FIPS-certified keys that are notoriously slow to upgrade. We estimate ~50 million "frozen" government keys. IoT Security: Of the ~21 billion connected IoT devices in 2026, only a fraction use WebAuthn. However, for those that do (smart locks, secure gateways), approximately 250 million are estimated to use older, non-upgradable secure elements limited to 1024-byte payloads. Recent government-level initiatives highlight the necessity to "...effectively deprecate the use of RSA, Diffie-Hellman (DH), and elliptic curve cryptography (ECDH and ECDSA) when mandated." , Page 4.

Pressing need: Limit or Stop 'Harvest now; decrypt later' Attacks Adversaries are collecting encrypted data today to decrypt when quantum computers become available. The transition to post-quantum cryptography (PQC) is critical for ensuring long-term security of digital communications against adversaries equipped with large-scale quantum computers. The National Institute of Standards and Technology (NIST) has been leading standardization efforts, having selected initial PQC algorithms and continuing to evaluate additional candidates. CBOR Object Signing and Encryption (COSE) is specifically designed for constrained node networks and IoT environments where bandwidth, storage, and computational resources are limited. The compact nature of SQIsign makes it an ideal candidate for COSE deployments.

Scope and Status This document is published on the Standards track rather than Informational Track for the following reasons: Algorithm Maturity: SQIsign is currently undergoing evaluation in NIST's on-ramp process Continued Cryptanalysis: The algorithm has active ongoing review by the cryptographic research community, including the IRTF CFRG High anticipated demand: This specification enables experimentation and early deployment to gather implementation experience This document does not represent Working Group consensus on algorithm innovation. The COSE and JOSE working groups focus on algorithm integration and encoding, not cryptographic algorithm design. The cryptographic properties of SQIsign are being evaluated through NIST's process and academic peer review.

Relationship to Other Work This document follows the precedent established by and for integrating NIST PQC candidate algorithms into COSE and JOSE. The structure and approach are intentionally aligned to provide consistency across post-quantum signature scheme integrations.

Constrained Device Applicability SQIsign is particularly attractive for: IoT sensors with limited flash memory Firmware updates over low-bandwidth networks (LoRaWAN, NB-IoT) Embedded certificates in constrained devices Blockchain and DLT where transaction size affects fees Satellite communications with bandwidth constraints

Conventions and Definitions The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 when, and only when, they appear in all capitals, as shown here. This document uses the following terms: PQC: Post-Quantum Cryptography COSE: CBOR Object Signing and Encryption JOSE: JSON Object Signing and Encryption JWS: JSON Web Signature JWK: JSON Web Key CBOR: Concise Binary Object Representation ECDH: Elliptic Curve Diffie-Hellman IANA: Internet Assigned Numbers Authority

Resistance to "Torsion Point" attack

SIKE Vulnerability (The "Torsion Point" Attack) of 2022 SIKE (Supersingular Isogeny Key Encapsulation) was a key exchange, more specifically, a Key Encapsulation Mechanism (KEM). In the SIKE protocol, users had to share more than just the target elliptic curve. To make the math work for key exchange, they shared the images of specific points (called torsion points) under the secret isogeny. The Info: If the secret isogeny is 𝜙, SIKE gave away 𝜙(𝑃) and 𝜙(𝑄) for specific basis points 𝑃 and 𝑄. The Break: In 2022, Castryck and Decru showed that this auxiliary information allowed an attacker to construct a higher-dimensional abelian variety linking the public data. In this setting, the secret isogeny can be recovered efficiently using techniques based on Kani’s results on isogenies between products of elliptic curves. The Oversight: For years, cryptanalysts thought this extra info was harmless. Related techniques existed in the algebraic geometry literature but had not previously been applied in this cryptographic context.

Why SQISign appears unaffected by the SIKE Vulnerability SQIsign is a signature scheme in which the prover demonstrates knowledge of an isogeny through a zero-knowledge protocol. Unlike SIDH/SIKE, it does not publish images of torsion basis points under secret isogenies, specifically: SIKE: key exchange with auxiliary structure leakage SQIsign: proof/verification of isogeny knowledge without publishing auxiliary isogeny action data The Castryck–Decru attack relies critically on this auxiliary torsion-point information to construct additional structure (e.g., via abelian surfaces) that enables efficient recovery of the secret isogeny. Because SQIsign does not provide such auxiliary data, these techniques do not directly apply. Attacks would instead need to solve instances of the isogeny path problem or related problems in the endomorphism ring, for which no comparable shortcut is currently known.

SQIsign Algorithm Overview

Cryptographic Foundation SQIsign is based on the hardness of finding isogenies between supersingular elliptic curves over finite fields. The security assumption relies primarily on the difficulty of the Isogeny Path Problem Unlike lattice-based schemes, isogeny-based cryptography offers: Smaller key and signature sizes Algebraic structure based on elliptic curve isogenies Different security assumptions (diversification from lattice-based schemes)

Security Levels SQIsign is defined with three parameter sets corresponding to NIST security levels: Parameter Set NIST Level Public Key Signature Classical Sec SQIsign-L1 I 65 bytes 148 bytes ~128 bits SQIsign-L3 III 97 bytes 224 bytes ~192 bits SQIsign-L5 V 129 bytes 292 bytes ~256 bits

Performance Characteristics Signing: Computationally intensive (slower than lattice schemes) Verification: Moderate computational cost Key Generation: Intensive computation required Size: Exceptional efficiency: substantially smaller than many lattice-based alternatives at comparable security levels Recommended Use Cases: - Sign-once, verify-many scenarios (firmware, certificates) - Bandwidth-constrained environments - Storage-limited devices - Applications where signature/key size dominates performance considerations

COSE Integration This section defines the identifiers for SQIsign in COSE .

SQIsign Algorithms The algorithms defined in this document are: SQIsign-L1: SQIsign NIST Level I (suggested value -61) SQIsign-L3: SQIsign NIST Level III (suggested value -62) SQIsign-L5: SQIsign NIST Level V (suggested value -63) Note: The algorithm identifier values (-61, -62, -63) are requested from IANA upon working group adoption. Early implementations may use temporary values from the Private Use range (-65000 to -65535) for experimentation.

SQIsign Key Types A new key type is defined for SQIsign with the name "SQIsign".

SQIsign Key Parameters SQIsign keys use the following COSE Key common parameters: Key Parameter COSE Label CBOR Type Description kty 1 int Key type: IETF (SQIsign) kid 2 bstr Key ID (optional) alg 3 int Algorithm identifier (-61, -62, or -63) key_ops 4 array Key operations (sign, verify)

SQIsign-Specific Key Parameters Key Parameter Label CBOR Type Description pub -1 bstr SQIsign public key priv -2 bstr SQIsign private key (sensitive)

COSE Key Format Examples NOTE: SQIsign keys are structurally distinct and not representable as existing EC key types due to non-classical representation.

Public Key (COSE_Key) cbor { 1: IETF, / kty: SQIsign / 3: -61, / alg: SQIsign-L1 / -1: h'[PUBLIC_KEY]' / pub: SQIsign public key bytes / }

Private Key (COSE_Key) cbor { 1: IETF, / kty: SQIsign / 3: -61, / alg: SQIsign-L1 / -1: h'[PUBLIC_KEY]', / pub: SQIsign public key bytes / -2: h'[PRIVATE_KEY]' / priv: SQIsign private key bytes / }

COSE Signature Format SQIsign signatures in COSE follow the standard COSE_Sign1 structure : COSE_Sign1 = [ protected: bstr .cbor header_map, unprotected: header_map, payload: bstr / nil, signature: bstr ] The signature field contains the raw SQIsign signature bytes.

Protected Headers The protected header MUST include: cbor { 1: -61 / alg: SQIsign-L1, -62 for L3, -63 for L5 / }

Example COSE_Sign1 Structure cbor 18( / COSE_Sign1 tag / [ h'A10139003C', / protected: {"alg": -61} / {}, / unprotected / h'546869732069732074686520636F6E74656E742E', / payload / h'[SQISIGN_SIGNATURE_BYTES]' / signature / ] )

JOSE Integration

JSON Web Signature (JWS) Algorithm Registration The following algorithm identifiers are registered for use in the JWS "alg" header parameter for JSON Web Signatures : Algorithm Name Description Implementation Requirements SQIsign-L1 SQIsign NIST Level I Optional SQIsign-L3 SQIsign NIST Level III Optional SQIsign-L5 SQIsign NIST Level V Optional

JSON Web Key (JWK) Representation SQIsign keys are represented in JWK format as follows:

Public Key Parameters Parameter Type Description kty string Key type: "SQIsign" alg string Algorithm: "SQIsign-L1", "SQIsign-L3", or "SQIsign-L5" pub string Base64url-encoded public key kid string Key ID (optional) use string Public key use: "sig" (optional) key_ops array Key operations: [verify] (optional)

Private Key Parameters Private keys include all public key parameters plus: Parameter Type Description priv string Base64url-encoded private key

JWK Examples

Public Key (JWK) Example json { "kty": "SQIsign", "alg": "SQIsign-L1", "pub": "KxtQx8s8RcBEU67wr57K37fdPEztN4M8NUC_\ 5xZuqgMwkaeJhM94YHi_-2UsQllbnmm-W4XFSLm2hUwiMylrAh0", "kid": "2027-01-device-key", "use": "sig", "key_ops": ["verify"] }

Private Key (JWK) Example json { "kty": "SQIsign", "alg": "SQIsign-L1", "pub": "KxtQx8s8RcBEU67wr57K37fdPEztN4M8NUC_\ 5xZuqgMwkaeJhM94YHi_-2UsQllbnmm-W4XFSLm2hUwiMylrAh0", "priv": "KxtQx8s8RcBEU67wr57K37fdPEztN4M8NUC_5xZuqgMwkaeJhM94YHi_\ -2UsQllbnmm-W4XFSLm2hUwiMylrAh1VwP9vNkBZH0Bjj2wc-\ p7sUgQAAAAAAAAAAAAAAAAAAN68tviJbcCpQ84fh-4IJB4-\ ____________________P38m3fKOhfhMspQU9GmA4CD5___\ _______________________________________________\ ___________wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\ AAAAAAA5cP9aha40v-8mFd_bdAgpR93Ug2iPhu4_NxG97C7\ 8wBvVMGOrQTCli7NxrR2KlPZR1AC5VddGf4p-ZjCzrWfAJv\ xhEh4uOKXq1MmuS9TwZGuz1YIYMIguu1wqjdmfaQAfOmK2g\ WWO3vcld5s7GR2AcrTv65ocK_pVUWY8eJDcQA", "kid": "2027-01-device-key", "use": "sig", "key_ops": ["sign"] }

JWS Compact Serialization A JWS using SQIsign follows the standard compact serialization: BASE64URL(UTF8(JWS Protected Header)) || '.' || BASE64URL(JWS Payload) || '.' || BASE64URL(JWS Signature)

Example JWS Protected Header json { "alg": "SQIsign-L1", "typ": "JWT" } Base64url-encoded: eyJhbGciOiJTUUlzaWduLUwxIiwidHlwIjoiSldUIn0

Complete JWS Example eyJhbGciOiJTUUlzaWduLUwxIiwidHlwIjoiSldUIn0 . [BASE64URL_PAYLOAD] . [BASE64URL_SQISIGN_SIGNATURE]

Implementation Considerations

Signature and Key Generation Implementations MUST follow the SQIsign specification for: Key pair generation Signature generation Signature verification

Randomness Requirements SQIsign signature generation requires high-quality randomness. Implementations MUST use a cryptographically secure random number generator (CSRNG) compliant with or equivalent.

Side-Channel Protections Implementations SHOULD implement protections against: Timing attacks Power analysis Fault injection attacks Particularly for constrained devices deployed in physically accessible environments.

Performance Trade-offs Implementers should be aware: Signing is computationally expensive: Consider pre-signing or batch operations Verification is moderate: Suitable for resource-constrained verifiers Size is exceptional: Minimizes bandwidth and storage

Interoperability Testing Early implementations SHOULD participate in interoperability testing to ensure: Consistent signature generation and verification Proper encoding in COSE and JOSE formats Cross-platform compatibility

Security Considerations

Algorithm Security The security of SQIsign relies primarily on the hardness of finding isogenies between supersingular elliptic curves. These assumptions are different from lattice-based schemes, providing cryptographic diversity in the post-quantum landscape.

Quantum Security SQIsign is designed to resist attacks by large-scale quantum computers. The three parameter sets provide security equivalent to AES-128, AES-192, and AES-256 against both classical and quantum adversaries.

Forward-Looking Quantum Risk: isogeny schemes vs lattice schemes Isogeny schemes are not yet trusted in the same way as lattice schemes, this section is here to avoid even the appearance of tone drift toward endorsement of isogeny schemes. No publicly known attacks applicable to the standardized parameter sets that recover full private keys under stated assumptions, but the field is evolving. SQISign's security is based on hardness assumptions different from factoring/discrete log problems, leading to the expectation it will resist known quantum attacks using Shor's algorithm . Ongoing research is exploring new types of quantum algorithms that could weaken certain underlying assumptions in isogeny-based cryptography. Organizations considering deployment should plan for long-term flexibility, including the ability to update or replace cryptographic algorithms as new information becomes available.

Quantum algorithms for isogeny path problems

Tani's algorithm Tani's algorithm achieves (O(N^{1/3})\ query complexity for claw-finding / quantum walk problems instead of (O(N^{1/2})). However, as analyzed by Jaques and Schanck , practical implementation faces significant barriers: Quantum RAM requirements: Exponentially large qRAM with sub-nanosecond access Parallelization limits: Circuit depth constraints reduce theoretical speedup Error correction overhead: Physical qubit requirements may exceed 10^9 qubits These constraints suggest that even with fault-tolerant quantum computers, Tani-style attacks remain impractical for security parameters used in SQIsign-L3 and SQIsign-L5.

Current Cryptanalysis Status As of this writing, SQIsign is undergoing active cryptanalytic review: NIST Round 2 evaluation: Academic research: Ongoing analysis of isogeny-based cryptography Known attacks: No attacks are currently known that recover private keys for the standardized parameter sets within their claimed security levels. However, the scheme and its underlying assumptions remain under active study. Implementers are advised: - Monitor NIST announcements and updates - Follow academic literature on isogeny cryptanalysis - Be prepared to deprecate or update as cryptanalysis evolves

Implementation Security

Random Number Generation Poor randomness can completely compromise SQIsign security. Implementations MUST use robust CSRNGs, especially on constrained devices with limited entropy sources.

Side-Channel Resistance Constrained devices may be physically accessible to attackers. Implementations SHOULD: Use constant-time algorithms where possible Implement countermeasures against DPA/SPA Consider fault attack mitigations

Key Management Private keys MUST be protected with appropriate access controls Consider hardware security modules (HSMs) or secure elements for key storage Implement key rotation policies appropriate to the deployment

Cryptographic Agility Organizations deploying SQIsign SHOULD: Maintain hybrid deployments with classical algorithms during transition Plan for algorithm migration if cryptanalysis reveals weaknesses Monitor NIST and IRTF guidance on PQC deployment

Constrained Device Specific Risks IoT devices face unique challenges: Physical access: Devices may be deployed in hostile environments Limited update capability: Firmware updates may be infrequent or impossible Long deployment lifetimes: Devices may operate for 10+ years Design systems with: - Defense in depth (multiple security layers) - Remote update capability when possible - Graceful degradation if algorithm is compromised

IANA Considerations

Additions to Existing Registries IANA is requested to add the following entries to the COSE and JOSE registries. The following completed registration actions are provided as described in and .

New COSE Algorithms IANA is requested to register the following entries in the "COSE Algorithms" registry: Name Value Description Capabilities Change Cont Ref Rec'd SQIsign-L1 -61 SQIsign NIST L I kty IETF THIS-RFC No SQIsign-L3 -62 SQIsign NIST L III kty IETF THIS-RFC No SQIsign-L5 -63 SQIsign NIST L V kty IETF THIS-RFC No

New COSE Key Types IANA is requested to register the following entry in the "COSE Key Types" registry: Name Value Description Capabilities Change Cont Ref SQIsign IETF SQIsign pub key sign, verify IETF THIS-RFC

New COSE Key Type Parameters IANA is requested to register the following entries in the "COSE Key Type Parameters" registry: Key Type Name Label CBOR Type Desc Change Cont Reference SQIsign pub -1 bstr Public key IETF THIS-RFC SQIsign priv -2 bstr Private key IETF THIS-RFC

New JWS Algorithms IANA is requested to register the following entries in the "JSON Web Signature and Encryption Algorithms" registry: Algorithm Name Desc Impl Req Change Cont Ref Recommended SQIsign-L1 SQIsign NIST L I Optional IETF THIS-RFC No SQIsign-L3 SQIsign NIST L III Optional IETF THIS-RFC No SQIsign-L5 SQIsign NIST L V Optional IETF THIS-RFC No

New JSON Web Key Types IANA is requested to register the following entry in the "JSON Web Key Types" registry: "kty" Param Value Key Type Desc Change Cont Reference SQIsign SQIsign public key IETF THIS-RFC

New JSON Web Key Parameters IANA is requested to register the following entries in the "JSON Web Key Parameters" registry: Param Name Desc Used with "kty" Val Change Cont Reference pub Public key SQIsign IETF THIS-RFC priv Private key SQIsign IETF THIS-RFC

Acknowledgments The authors would like to thank: Luca DeFeo for reviewing draft-00 and providing valuable feedback. Any remaining errors are solely the responsibility of the authors. The SQIsign design team for groundbreaking work on isogeny-based signatures The NIST PQC team for managing the standardization process The COSE and JOSE working groups for guidance on integration The IRTF Crypto Forum Research Group for ongoing cryptanalytic review Early implementers who provide valuable feedback This work builds upon the template established by and similar PQC integration efforts.

References

Normative References Populated automatically from metadata

Informative References Populated automatically from metadata

JSON Web Signature (JWS) represents content secured with digital signatures or Message Authentication Codes (MACs) using JSON-based data structures. Cryptographic algorithms and identifiers for use with this specification are described in the separate JSON Web Algorithms (JWA) specification and an IANA registry defined by that specification. Related encryption capabilities are described in the separate JSON Web Encryption (JWE) specification. A JSON Web Key (JWK) is a JavaScript Object Notation (JSON) data structure that represents a cryptographic key. This specification also defines a JWK Set JSON data structure that represents a set of JWKs. Cryptographic algorithms and identifiers for use with this specification are described in the separate JSON Web Algorithms (JWA) specification and IANA registries established by that specification. Concise Binary Object Representation (CBOR) is a data format designed for small code size and small message size. There is a need for the ability to have basic security services defined for this data format. This document defines the CBOR Object Signing and Encryption (COSE) protocol. This specification describes how to create and process signatures, message authentication codes, and encryption using CBOR for serialization. This specification additionally describes how to represent cryptographic keys using CBOR. Concise Binary Object Representation (CBOR) is a data format designed for small code size and small message size. There is a need to be able to define basic security services for this data format. This document defines the CBOR Object Signing and Encryption (COSE) protocol. This specification describes how to create and process signatures, message authentication codes, and encryption using CBOR for serialization. This specification additionally describes how to represent cryptographic keys using CBOR. This document, along with RFC 9053, obsoletes RFC 8152. Concise Binary Object Representation (CBOR) is a data format designed for small code size and small message size. There is a need to be able to define basic security services for this data format. This document defines a set of algorithms that can be used with the CBOR Object Signing and Encryption (COSE) protocol (RFC 9052). This document, along with RFC 9052, obsoletes RFC 8152. The CBOR Object Signing and Encryption (COSE) syntax (see RFC 9052) does not define any direct methods for using hash algorithms. There are, however, circumstances where hash algorithms are used, such as indirect signatures, where the hash of one or more contents are signed, and identification of an X.509 certificate or other object by the use of a fingerprint. This document defines hash algorithms that are identified by COSE algorithm identifiers. In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements. RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings. Security systems are built on strong cryptographic algorithms that foil pattern analysis attempts. However, the security of these systems is dependent on generating secret quantities for passwords, cryptographic keys, and similar quantities. The use of pseudo-random processes to generate secret quantities can result in pseudo-security. A sophisticated attacker may find it easier to reproduce the environment that produced the secret quantities and to search the resulting small set of possibilities than to locate the quantities in the whole of the potential number space. Choosing random quantities to foil a resourceful and motivated adversary is surprisingly difficult. This document points out many pitfalls in using poor entropy sources or traditional pseudo-random number generation techniques for generating such quantities. It recommends the use of truly random hardware techniques and shows that the existing hardware on many systems can be used for this purpose. It provides suggestions to ameliorate the problem when a hardware solution is not available, and it gives examples of how large such quantities need to be for some applications. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements. The Concise Binary Object Representation (CBOR) is a data format whose design goals include the possibility of extremely small code size, fairly small message size, and extensibility without the need for version negotiation. These design goals make it different from earlier binary serializations such as ASN.1 and MessagePack. mesur.io Tradeverifyd University of the Bundeswehr Munich This document specifies JSON Object Signing and Encryption (JOSE) and CBOR Object Signing and Encryption (COSE) serializations for FFT (fast-Fourier transform) over NTRU-Lattice-Based Digital Signature Algorithm (FN-DSA), a Post-Quantum Cryptography (PQC) digital signature scheme defined in US NIST FIPS 206 (expected to be published in late 2026 early 2027). It does not define new cryptographic primitives; rather, it specifies how existing FN-DSA mechanisms are serialized for use in JOSE and COSE. This document registers signature algorithms for JOSE and COSE, specifically FN-DSA-512 and FN-DSA-1024. Tradeverifyd Tradeverifyd This document specifies JSON Object Signing and Encryption (JOSE) and CBOR Object Signing and Encryption (COSE) serializations for Module- Lattice-Based Digital Signature Standard (ML-DSA), a Post-Quantum Cryptography (PQC) digital signature scheme defined in US NIST FIPS 204. NIST IACR ePrint Archive National Security Agency University of Quantum Science

Test Vectors

SQIsign-L1 Test Vectors

Example 1: Simple Message Signing The following test vector exhibits a SQIsign Level I signature over a short message. Message (hex): d81c4d8d734fcbfbeade3d3f8a039faa2a2c9957e835ad55b2 \ 2e75bf57bb556ac8 Message (ASCII): MsO=?*,W5U.uWUj Public Key (hex): 07CCD21425136F6E865E497D2D4D208F0054AD81372066E \ 817480787AAF7B2029550C89E892D618CE3230F23510BFBE68FCCDDAEA51DB1436 \ B462ADFAF008A010B Public Key (Base64url): B8zSFCUTb26GXkl9LU0gjwBUrYE3IGboF0gHh6r3s \ gKVUMieiS1hjOMjDyNRC_vmj8zdrqUdsUNrRirfrwCKAQs Signature (hex): 84228651f271b0f39f2f19f2e8718f31ed3365ac9e5cb303 \ afe663d0cfc11f0455d891b0ca6c7e653f9ba2667730bb77befe1b1a3182840428 \ 4af8fd7baacc010001d974b5ca671ff65708d8b462a5a84a1443ee9b5fed721876 \ 7c9d85ceed04db0a69a2f6ec3be835b3b2624b9a0df68837ad00bcacc27d1ec806 \ a44840267471d86eff3447018adb0a6551ee8322ab30010202 Signature (Base64url): hCKGUfJxsPOfLxny6HGPMe0zZayeXLMDr-Zj0M_BHw \ RV2JGwymx-ZT-bomZ3MLt3vv4bGjGChAQoSvj9e6rMAQAB2XS1ymcf9lcI2LRipahK \ FEPum1_tchh2fJ2Fzu0E2wppovbsO-g1s7JiS5oN9og3rQC8rMJ9HsgGpEhAJnRx2G \ 7_NEcBitsKZVHugyKrMAECAg

COSE_Sign1 Complete Example cbor 18( [ h'a10139003c', / protected: {"alg": -61} / {}, / unprotected / h'd81c4d8d734fcbfbeade3d3f8a039faa2a2c9957e835ad55b22e75bf57bb \ 556ac8', / payload / h'84228651f271b0f39f2f19f2e8718f31ed3365ac9e5cb303afe663d0cfc1 \ 1f0455d891b0ca6c7e653f9ba2667730bb77befe1b1a31828404284af8fd7b \ aacc010001d974b5ca671ff65708d8b462a5a84a1443ee9b5fed7218767c9d \ 85ceed04db0a69a2f6ec3be835b3b2624b9a0df68837ad00bcacc27d1ec806 \ a44840267471d86eff3447018adb0a6551ee8322ab30010202' ] )

JWS Complete Example eyJhbGciOiJTUUlzaWduLUwxIiwidHlwIjoiSldUIn0 . 2BxNjXNPy_vq3j0_igOfqiosmVfoNa1Vsi51v1e7VWrI . hCKGUfJxsPOfLxny6HGPMe0zZayeXLMDr-Zj0M_BHwRV2JGwymx-ZT-bomZ3MLt3vv \ 4bGjGChAQoSvj9e6rMAQAB2XS1ymcf9lcI2LRipahKFEPum1_tchh2fJ2Fzu0E2wpp \ ovbsO-g1s7JiS5oN9og3rQC8rMJ9HsgGpEhAJnRx2G7_NEcBitsKZVHugyKrMAECAg

SQIsign-L3 Test Vectors [PLACEHOLDER FOR L3 TEST VECTORS]

SQIsign-L5 Test Vectors [PLACEHOLDER FOR L5 TEST VECTORS]

Implementation Status [RFC Editor: Please remove this section before publication] This section records the status of known implementations at the time of writing.

Open Source Implementations

Reference Implementation Organization: SQIsign team Repository: https://github.com/SQISign/the-sqisign Language: C License: MIT Status: Active development COSE/JOSE Support: Not yet integrated

Rust Implementation Organization: IETF - Community implementation Repository: IETF Language: Rust License: IETF COSE Support: Planned Status: Development

Commercial Implementations [RFC EDITOR: To be populated as vendors implement]

Interoperability Testing Test Suite Location: IETF Participating Organizations: IETF

Design Rationale

Algorithm Identifier Selection The requested algorithm identifiers (-61, -62, -63) are: In the range designated for experimental/informational use Sequential for the three parameter sets Not conflicting with existing registrations Consistent with the approach used for other PQC algorithms

Key Type Design The SQIsign key type is intentionally simple: Only two parameters (pub, priv) following minimalist design Binary encoding (bstr) for efficiency No algorithm-specific encoding—raw bytes from SQIsign spec This approach: - Minimizes CBOR encoding overhead (critical for constrained devices) - Simplifies implementation - Provides future flexibility for parameter set evolution

Change Log [RFC Editor Note:** Please remove this section before publication]

draft-mott-cose-sqisign-03 Incorporated technical corrections and feedback from Luca De Feo on draft-00 Updated the Abstract and Introduction to utilize more neutral, objective language Removed vendor-specific branding in favor of generic cryptographic terminology fixed various formatting issues