Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications (Q4500854)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1496866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications |
scientific article; zbMATH DE number 1496866 |
Statements
Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications (English)
0 references
22 November 2000
0 references
pseudorandom bits
0 references
stream ciphers
0 references
sparse polynomials
0 references
polynomial time algorithm
0 references
Jacobi symbols of exponentially large integers
0 references
sparse integers
0 references
0.8107767105102539
0 references
