Covering groupIn mathematics, a covering group of a topological group H is a covering space G of H such that G is a topological group and the covering map p : G → H is a continuous group homomorphism. The map p is called the covering homomorphism. A frequently occurring case is a double covering group, a topological double cover in which H has index 2 in G; examples include the spin groups, pin groups, and metaplectic groups.
Private information retrievalIn cryptography, a private information retrieval (PIR) protocol is a protocol that allows a user to retrieve an item from a server in possession of a database without revealing which item is retrieved. PIR is a weaker version of 1-out-of-n oblivious transfer, where it is also required that the user should not get information about other database items. One trivial, but very inefficient way to achieve PIR is for the server to send an entire copy of the database to the user.
Interactive proof systemIn computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties: a prover and a verifier. The parties interact by exchanging messages in order to ascertain whether a given string belongs to a language or not. The prover possesses unlimited computational resources but cannot be trusted, while the verifier has bounded computation power but is assumed to be always honest.
WebAuthnWeb Authentication (WebAuthn) is a web standard published by the World Wide Web Consortium (W3C). WebAuthn is a core component of the FIDO2 Project under the guidance of the FIDO Alliance. The goal of the project is to standardize an interface for authenticating users to web-based applications and services using public-key cryptography. On the client side, support for WebAuthn can be implemented in a variety of ways.
Character groupIn mathematics, a character group is the group of representations of a group by complex-valued functions. These functions can be thought of as one-dimensional matrix representations and so are special cases of the group characters that arise in the related context of character theory. Whenever a group is represented by matrices, the function defined by the trace of the matrices is called a character; however, these traces do not in general form a group.
Character (mathematics)In mathematics, a character is (most commonly) a special kind of function from a group to a field (such as the complex numbers). There are at least two distinct, but overlapping meanings. Other uses of the word "character" are almost always qualified. multiplicative character A multiplicative character (or linear character, or simply character) on a group G is a group homomorphism from G to the multiplicative group of a field , usually the field of complex numbers.
Dirichlet characterIn analytic number theory and related branches of mathematics, a complex-valued arithmetic function is a Dirichlet character of modulus (where is a positive integer) if for all integers and : that is, is completely multiplicative. (gcd is the greatest common divisor) that is, is periodic with period . The simplest possible character, called the principal character, usually denoted , (see Notation below) exists for all moduli: The German mathematician Peter Gustav Lejeune Dirichlet—for whom the character is named—introduced these functions in his 1837 paper on primes in arithmetic progressions.
