scientific article; zbMATH DE number 2204782

Publication date: 13 September 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

computational complexity finite fields congruences factorization algebraic structures discrete logarithm primality testing

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Finite fields (field-theoretic aspects) (12E20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Factorization (11Y05) Primality (11Y11) Elementary number theory (11Axx)

Related Items (44)

A Lattice-Based Certificateless Public Key Encryption with Equality Test in Standard Model ⋮ Non-malleable codes for bounded parallel-time tampering ⋮ Factoring multi-power RSA moduli with primes sharing least or most significant bits ⋮ A linear-time algorithm for the orbit problem over cyclic groups ⋮ A babystep-giantstep method for faster deterministic integer factorization ⋮ Some properties of the factors of Fermat numbers ⋮ The $\mathbb Q$-curve construction for endomorphism-accelerated elliptic curves ⋮ Identity-based signature scheme based on quadratic residues ⋮ Efficient cryptosystems from $2^k$-th power residue symbols ⋮ Breaking Goppa-based McEliece with hints ⋮ Fair and distributed peer-to-peer allocation of a common, refillable resource ⋮ Decoding McEliece with a hint -- secret Goppa key parts reveal everything ⋮ Numerical estimates on the Landau-Siegel zero and other related quantities ⋮ Public-Key Cryptosystems with Primitive Power Roots of Unity ⋮ A unified strategy to compute some special functions of number-theoretic interest ⋮ Discrete logarithm based additively homomorphic encryption and secure data aggregation ⋮ Programmable hash functions and their applications ⋮ Security models and proof strategies for plaintext-aware encryption ⋮ Lattice-based completely non-malleable public-key encryption in the standard model ⋮ Good reduction of Puiseux series and applications ⋮ Resource fairness and composability of cryptographic protocols ⋮ Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system ⋮ Simultaneous modular reduction and Kronecker substitution for small finite fields ⋮ Confined guessing: new signatures from standard assumptions ⋮ Speeding Up the Pollard Rho Method on Prime Fields ⋮ The Berlekamp-Massey algorithm revisited ⋮ Unnamed Item ⋮ Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know? ⋮ Relations Among Notions of Plaintext Awareness ⋮ Discrete logarithm problems with auxiliary inputs ⋮ Contributory Password-Authenticated Group Key Exchange with Join Capability ⋮ Short fail-stop signature scheme based on factorization and discrete logarithm assumptions ⋮ Remarks on Gödel’s code as a hash function ⋮ Symmetric cryptoalgorithms in the residue number system ⋮ Fault Attacks on RSA Public Keys: Left-To-Right Implementations Are Also Vulnerable ⋮ Structure computation and discrete logarithms in finite abelian $p$-groups ⋮ Verifiable random functions: relations to identity-based key encapsulation and new constructions ⋮ Optimal Randomness Extraction from a Diffie-Hellman Element ⋮ Factorization patterns on nonlinear families of univariate polynomials over a finite field ⋮ Isogeny-based key compression without pairings ⋮ An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code ⋮ Factorization Tests and Algorithms Arising from Counting Modular Forms and Automorphic Representations ⋮ Using basis dependence distance vectors in the modified Floyd-Warshall algorithm ⋮ Authenticated hash tables based on cryptographic accumulators

This page was built for publication: