Martin R. Albrecht

Author Info

Name	Affiliation	Papers
MARTIN R. ALBRECHT	INRIA, Paris-Rocquencourt Center, SALSA Project, UPMC Univ Paris 06, UMR 7606, LIP6, Paris, France	49
Collaborators	Citations	PageRank
101	309	25.33
Referers	Referees	References
741	619	494

Search Limit

100741

Publications (49 rows)

Collaborators (100 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable.	0	0.34	2022
Predicting BKZ Z-Shapes on q-ary Lattices.	0	0.34	2022
Four Attacks and a Proof for Telegram	0	0.34	2022
Subtractive Sets Over Cyclotomic Rings Limits Of Schnorr-Like Arguments Over Lattices	0	0.34	2021
Collective Information Security in Large-Scale Urban Protests: the Case of Hong Kong	0	0.34	2021
Lattice Reduction With Approximate Enumeration Oracles Practical Algorithms And Concrete Performance	1	0.34	2021
Multilinear Maps from Obfuscation	0	0.34	2020
The General Sieve Kernel and New Records in Lattice Reduction.	2	0.36	2019
Libintermac: Beyond Confidentiality And Integrity In Practice	0	0.34	2019
Homomorphic Encryption Standard.	0	0.34	2019
Implementing RLWE-based Schemes Using an RSA Co-Processor.	0	0.34	2019
Feistel Structures for MPC, and More.	0	0.34	2019
Algebraic Cryptanalysis of STARK-Friendly Designs: Application to MARVELlous and MiMC.	0	0.34	2019
Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices.	0	0.34	2019
Cold Boot Attacks on Ring and Module LWE Keys Under the NTT.	0	0.34	2018
Estimate all the {LWE, NTRU} schemes!	4	0.40	2018
Learning with Errors on RSA Co-Processors.	0	0.34	2018
Prime and Prejudice: Primality Testing Under Adversarial Conditions.	0	0.34	2018
Large Modulus Ring-LWE >= Module-LWE.	0	0.34	2017
Revisiting the Expected Cost of Solving uSVP and Applications to LWE.	9	0.57	2017
On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL.	26	0.85	2017
Notes on GGH13 Without the Presence of Ideals.	1	0.35	2017
Tightly Secure Ring-Lwe Based Key Encapsulation With Short Ciphertexts	5	0.43	2017
Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography.	1	0.42	2017
Large Modulus Ring-LWE ≥ Module-LWE.	0	0.34	2017
A Surfeit of SSH Cipher Suites.	8	0.59	2016
Multilinear Maps from Obfuscation.	8	0.71	2016
Polly Cracker, revisited	0	0.34	2016
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity.	8	0.42	2016
Lucky Microseconds: A Timing Attack on Amazon's s2n Implementation of TLS.	16	0.64	2015
Block Ciphers - Focus On The Linear Layer (feat. PRIDE): Full Version.	1	0.38	2014
Block Ciphers - Focus on the Linear Layer (feat. PRIDE).	43	1.53	2014
Algebraic Algorithms for LWE Problems.	2	0.41	2014
The M4RIE library for dense linear algebra over small fields with even characteristic	1	0.37	2012
On the complexity of the BKW algorithm on LWE	28	1.04	2012
On the relation between the MXL family of algorithms and Gröbner basis algorithms	8	0.47	2012
An All-In-One Approach to Differential Cryptanalysis for Small Block Ciphers.	11	0.55	2012
Cold boot key recovery by solving polynomial systems with noise	16	1.02	2011
Polly cracker, revisited	10	0.72	2011
On the Relation Between the Mutant Strategy and the Normal Selection Strategy in Gröbner Basis Algorithms.	1	0.37	2011
Breaking an identity-based encryption scheme based on DHIES	1	0.35	2011
Efficient Dense Gaussian Elimination over the Finite Field with Two Elements	2	0.40	2011
Efficient Decomposition of Dense Matrices over GF(2)	1	0.38	2010
Algebraic precomputations in differential and integral cryptanalysis	5	0.46	2010
Algorithm 898: Efficient multiplication of dense matrices over GF(2)	13	0.66	2010
Plaintext Recovery Attacks against SSH	28	1.36	2009
Algebraic Techniques in Differential Cryptanalysis	28	1.31	2009
Attacking cryptographic schemes based on "perturbation polynomials"	14	0.77	2009
Efficient Multiplication of Dense Matrices over GF(2)	7	0.60	2008