NEARBY SLOPES AND BOUNDEDNESS FOR `-ADIC SHEAVES IN POSITIVE CHARACTERISTIC by Jean-Baptiste Teyssier Abstract. — The goal of this paper is to motivate a boundedness conjecture for

Source URL: jbteyssier.com

• Algebra
• Abstract algebra
• Ring theory
• Algebraic number theory
• Field theory
• Complex analysis
• Algebraic topology
• Ramification
• Conductor
• Valuation
• Proper morphism
• Field extension

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

Source URL: perso.ens-lyon.fr

1 Computing Minimal Update Sequences for Graceful Router-wide Reconfigurations Francois Clad1 , Stefano Vissicchio2 , Pascal Mérindol1 , Pierre Francois3 and Jean-Jacques Pansiot1 1

Source URL: www0.cs.ucl.ac.uk

• Computing
• Routing protocols
• Data transmission
• Network architecture
• Internet architecture
• Internet Standards
• Internet protocols
• Routing algorithms
• Constraint
• Open Shortest Path First
• Link-state routing protocol
• Router

Non-randomness in eSTREAM Candidates Salsa20 and TSC-4 Simon Fischer1 , Willi Meier1 , Cˆ ome Berbain , Jean-Fran¸cois Biasse2 , and M.J.B. Robshaw2 2

Source URL: www.lix.polytechnique.fr

• Cryptography
• Stream ciphers
• Salsa20
• VEST
• Tiny Encryption Algorithm
• Keystream
• ESTREAM
• ICE
• Weak key
• Data Encryption Standard
• Indocrypt

Exhaustive Key Search of the DES: Updates and Refinements Jean-Jacques Quisquater & Fran¸cois-Xavier Standaert UCL Crypto Group Laboratoire de Micro´electronique Universit´e Catholique de Louvain

Source URL: www.hyperelliptic.org

• Cryptography
• Data Encryption Standard
• Applied mathematics
• Software optimization
• Cryptanalysis
• Block cipher
• FEAL
• Brute-force attack
• Rainbow table
• Cipher
• Reconfigurable computing
• EFF DES cracker

UN THÉORÈME DE LINÉARITÉ DE LA CONSTRUCTION D’ABBES ET SAITO POUR LES CONNEXIONS MÉROMORPHES. par Jean-Baptiste Teyssier

Source URL: jbteyssier.com

Hardware for Collision Search m on Elliptic Curve over GF(2 ) Philippe Bulens (S), Guerric Meurice de Dormale and Jean-Jacques Quisquater {bulens, gmeurice, quisquater}@dice.ucl.ac.be

Source URL: www.hyperelliptic.org

• Finite fields
• Algebraic number theory
• Frobenius endomorphism
• Galois theory
• Meurice
• Jean-Jacques Quisquater
• Mathematics

MODULI OF STOKES TORSORS AND SINGULARITIES OF DIFFERENTIAL EQUATIONS by Jean-Baptiste Teyssier Abstract. — Let M be a meromorphic connection with poles along a smooth divisor

Source URL: jbteyssier.com

• Algebra
• Abstract algebra
• Algebraic geometry
• Geometry
• Moduli space
• Divisor
• Torsor
• Sheaf
• Algebraic variety

Smoothness Testing of Polynomials over Finite Fields Jean-Franc ¸ ois Biasse and Michael J. Jacobson Jr. Department of Computer Science, University of Calgary 2500 University Drive NW

Source URL: www.lix.polytechnique.fr

• Mathematics
• Multiplication
• Polynomials
• Algebra
• Multiplication algorithm
• Computer algebra
• ToomCook multiplication
• Karatsuba algorithm
• Degree of a polynomial
• Finite field
• Remainder
• Computational complexity of mathematical operations

Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic David Defour Guillaume Hanrot Jean-Michel Muller

Source URL: perso.ens-lyon.fr

• Computer arithmetic
• Arithmetic
• Mathematics
• Computer architecture
• Rounding
• IEEE 754
• Double-precision floating-point format
• Interval arithmetic
• Significant figures
• NaN
• Sine
• Signed zero