The following pages link to Johannes A. Buchmann (Q1179459):
Displaying 50 items.
- (Q194715) (redirect page) (← links)
- (Q1805355) (redirect page) (← links)
- A multivariate based threshold ring signature scheme (Q371251) (← links)
- On the security of the Winternitz one-time signature scheme (Q381135) (← links)
- Full analysis of \textsc{PRINTcipher} with respect to invariant subspace attack: efficient key recovery and countermeasures (Q404952) (← links)
- Binary quadratic forms. An algorithmic approach (Q873951) (← links)
- An algorithm for testing Leopoldt's conjecture (Q1091426) (← links)
- On principal ideal testing in algebraic number fields (Q1092112) (← links)
- A key-exchange system based on imaginary quadratic fields (Q1112782) (← links)
- Some remarks concerning the complexity of computing class groups of quadratic fields (Q1179460) (← links)
- A key-exchange protocol using real quadratic fields (Q1335027) (← links)
- Long-term secure time-stamping using preimage-aware hash functions (short version) (Q1616881) (← links)
- Performing computations on hierarchically shared secrets (Q1653229) (← links)
- Revisiting TESLA in the quantum random oracle model (Q1673600) (← links)
- \(\mathsf{ELSA}\): efficient long-term secure storage of large datasets (Q1736059) (← links)
- A linearly homomorphic signature scheme from weaker assumptions (Q1744864) (← links)
- Recovering short generators of principal fractional ideals in cyclotomic fields of conductor \(p^\alpha q^\beta\) (Q1746853) (← links)
- Approximating rings of integers in number fields (Q1805356) (← links)
- On the computation of units and class numbers by a generalization of Lagrange's algorithm (Q1820814) (← links)
- On the period length of the generalized Lagrange algorithm (Q1820815) (← links)
- A signature scheme based on the intractability of computing roots (Q1862440) (← links)
- On smooth ideals in number fields (Q1920898) (← links)
- On lattice-based interactive protocols: an approach with less or no aborts (Q2030863) (← links)
- Function-dependent commitments from homomorphic authenticators (Q2183939) (← links)
- \textsf{BLAZE}: practical lattice-based blind signatures for privacy-preserving applications (Q2226610) (← links)
- Context hiding multi-key linearly homomorphic authenticators (Q2290469) (← links)
- Efficient proactive secret sharing for large data via concise vector commitments (Q2327183) (← links)
- On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge (Q2363734) (← links)
- Post-quantum cryptography: lattice signatures (Q2390954) (← links)
- Long-term secure commitments via extractable-binding commitments (Q2399947) (← links)
- Estimation of the hardness of the learning with errors problem with a restricted number of samples (Q2415419) (← links)
- Long term confidentiality: a survey (Q2448088) (← links)
- A Terr algorithm for computations in the infrastructure of real-quadratic number fields (Q2642773) (← links)
- (Q2707606) (← links)
- (Q2710175) (← links)
- (Q2764229) (← links)
- Post-Quantum Cryptography: State of the Art (Q2803619) (← links)
- On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack (Q2814692) (← links)
- An Efficient Lattice-Based Signature Scheme with Provably Secure Instantiation (Q2814694) (← links)
- Password Requirements Markup Language (Q2817483) (← links)
- Minkowski, Hermite und das Internet (Q2855696) (← links)
- Introduction to Public Key Infrastructures (Q2864141) (← links)
- Post-quantum cryptography: lattice identification schemes (Q2898871) (← links)
- Algebraic Cryptanalysis of the Round-Reduced and Side Channel Analysis of the Full PRINTCipher-48 (Q2901354) (← links)
- On the Efficiency of Provably Secure NTRU (Q2938672) (← links)
- Mutant Differential Fault Analysis of Trivium MDFA (Q2942851) (← links)
- Tuning GaussSieve for Speed (Q2946481) (← links)
- On the Security of Long-Lived Archiving Systems Based on the Evidence Record Syntax (Q2947064) (← links)
- Nearest Planes in Practice (Q2947117) (← links)
- Augmented Learning with Errors: The Untapped Potential of the Error Term (Q2948191) (← links)
- Improvement and Efficient Implementation of a Lattice-Based Signature Scheme (Q2949522) (← links)