The following pages link to Rainer Steinwandt (Q189267):
Displaying 50 items.
- Combined schemes for signature and encryption: the public-key and the identity-based setting (Q259033) (← links)
- On using probabilistic Turing machines to model participants in cryptographic protocols (Q391316) (← links)
- Security of message authentication codes in the presence of key-dependent messages (Q420612) (← links)
- Identity-based non-interactive key distribution with forward security (Q420643) (← links)
- A note on quantum related-key attacks (Q458382) (← links)
- Cryptanalysis of a 2-party key establishment based on a semigroup action problem (Q534523) (← links)
- Attribute-based group key establishment (Q540385) (← links)
- Towards a uniform description of several group based cryptographic primitives (Q702182) (← links)
- Scalable attribute-based group key establishment: from~passive to active and deniable (Q744010) (← links)
- A ciphertext-only attack on Polly Two (Q964735) (← links)
- Special issue dedicated to Spyros Magliveras on the occasion of his 70th birthday (Q970547) (← links)
- A one-time signature using run-length encoding (Q975441) (← links)
- Cryptanalysis of an authentication scheme using truncated polynomials (Q989509) (← links)
- Basic algorithms for rational function fields (Q1284279) (← links)
- Cryptanalysis of a knapsack-like cryptosystem (Q1410428) (← links)
- Recognizing simple subextensions of purely transcendental field extensions (Q1583884) (← links)
- Gröbner bases applied to finitely generated field extensions (Q1588034) (← links)
- Clouds over a public key cryptosystem based on Lyndon words (Q1607122) (← links)
- On the security of the Courtois-Finiasz-Sendrier signature (Q1643411) (← links)
- Involutive bases in the Weyl algebra. (Q1864886) (← links)
- On the security of two public key cryptosystems using non-abelian groups (Q1877355) (← links)
- A reaction attack on a public key cryptosystem based on the word problem (Q1879274) (← links)
- Decomposing a matrix into circulant and diagonal factors (Q1971041) (← links)
- Freeness, linear disjointness, and implicitization -- a classical approach. (Q1975385) (← links)
- Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves (Q2018146) (← links)
- Password-authenticated group key establishment from smooth projective hash functions (Q2299203) (← links)
- On the security margin of MAC striping (Q2353635) (← links)
- Pitfalls in public key cryptosystems based on free partially commutative monoids and groups (Q2371104) (← links)
- Power attacks on a side-channel resistant elliptic curve implementation (Q2390277) (← links)
- Private set intersection: new generic constructions and feasibility results (Q2408281) (← links)
- Cryptanalysis of the Tillich-Zémor hash function (Q2429714) (← links)
- Computing restrictions of ideals in finitely generated \(k\)-algebras by means of Buchberger's algorithm (Q2457340) (← links)
- Weak keys in MST\(_{1}\) (Q2491250) (← links)
- Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count (Q2516141) (← links)
- (Q2724591) (← links)
- (Q2724594) (← links)
- Differential Power Analysis of a McEliece Cryptosystem (Q2794516) (← links)
- Applying Grover’s Algorithm to AES: Quantum Resource Estimates (Q2802601) (← links)
- Masking Large Keys in Hardware: A Masked Implementation of McEliece (Q2807215) (← links)
- Deniable Group Key Agreement (Q2876984) (← links)
- Towards Provably Secure Group Key Agreement Building on Group Theory (Q2876987) (← links)
- Multi-authority attribute-based encryption with honest-but-curious central authority (Q2887037) (← links)
- Narrow Bandwidth Is Not Inherent in Reverse Public-Key Encryption (Q2922683) (← links)
- PET SNAKE: A Special Purpose Architecture to Implement an Algebraic Attack in Hardware (Q3066476) (← links)
- Communication-Efficient 2-Round Group Key Establishment from Pairings (Q3073695) (← links)
- Security of signature schemes in the presence of key-dependent messages (Q3075869) (← links)
- (Q3101666) (← links)
- (Q3156428) (← links)
- (Q3410209) (← links)
- A redundant representation of GF(q<sup>n</sup>) for designing arithmetic circuits (Q3417027) (← links)
