<--- Back to Details
First PageDocument Content
Algebraic number theory / Field theory / Algebraic structures / Group theory / Number theory / Polynomial / General number field sieve / Algebraic number field / Ideal class group / Abstract algebra / Mathematics / Algebra
Date: 2014-05-28 20:52:54
Algebraic number theory
Field theory
Algebraic structures
Group theory
Number theory
Polynomial
General number field sieve
Algebraic number field
Ideal class group
Abstract algebra
Mathematics
Algebra

DMVSaminar Band21 Computational Algebraic Number Theory

Add to Reading List

Source URL: www.plouffe.fr

Download Document from Source Website

File Size: 2,37 MB

Share Document on Facebook

Similar Documents

Theoretical computer science / Computational complexity theory / Mathematical logic / Constraint programming / Logic in computer science / Electronic design automation / Formal methods / NP-complete problems / Boolean satisfiability problem / Satisfiability modulo theories / Maximum satisfiability problem / Local consistency

Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions⋆ Daniel Larraz, Albert Oliveras, Enric Rodr´ıguez-Carbonell, and Albert Rubio Universitat Polit`ecnica de Catalunya, Barcelona, Spain

DocID: 1xVFd - View Document

Algebra / Abstract algebra / Mathematics / Commutative algebra / Lattice-based cryptography / Post-quantum cryptography / Cryptography / Field theory / Ring learning with errors / Ring learning with errors key exchange / Ring learning with errors signature

On the Ring-LWE and Polynomial-LWE Problems Miruna Rosca1,2 , Damien Stehlé1 , and Alexandre Wallet1 1 ENS de Lyon, Laboratoire LIP (U. Lyon, CNRS, ENSL, INRIA, UCBL), France

DocID: 1xVxG - View Document

Algebra / Polynomial / RASAT / Inequality / NP-complete problems

raSAT: SMT for Polynomial Inequality To Van Khanh (UET/VNU-HN) Vu Xuan Tung, Mizuhito Ogawa (JAIST

DocID: 1xVsE - View Document

Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits In memory of Wen-tsun Wu–Jean-Guillaume Dumas

DocID: 1xUE0 - View Document

Cryptography / Mathematics / Polynomials / Multivariate cryptography / Algebra / Pseudorandom number generator / Computer algebra / Hidden Field Equations / QUAD / Field extension / Cryptographically secure pseudorandom number generator / Mersenne Twister

Secure PRNGs from Specialized Polynomial Maps over Any Fq Feng-Hao Liu1 , Chi-Jen Lu2 , and Bo-Yin Yang2 1 Department of Computer Science, Brown University, Providence RI, USA

DocID: 1xUwb - View Document