Algorithmic Number Theory First International Symposium, ANTS-I, 1994 Proceedings

about

Constructing elliptic curves with given group order over large finite fields On the difficulty of finding reliable witnesses Polynomial time algorithms for discrete logarithms and factoring on a quantum computer

P1433

Q56047755-1A1D1942-10ED-4CC8-B949-D027E94F820F Q56144952-7BDBD148-F8AC-4192-890C-3C6F36B9DF08 Q91403864-63E20A8D-64B1-4071-912D-6F25F8CB97D2

P1433

Algorithmic Number Theory First International Symposium, ANTS-I, 1994 Proceedings

Item

http://www.wikidata.org/entity/Q91401989

description

conference proceedings published in 1994

@en

name

Algorithmic Number Theory First International Symposium, ANTS-I, 1994 Proceedings

@en

type

Item

label

Algorithmic Number Theory First International Symposium, ANTS-I, 1994 Proceedings

@en

prefLabel

Algorithmic Number Theory First International Symposium, ANTS-I, 1994 Proceedings

@en

P1476

Algorithmic Number Theory First International Symposium, ANTS-I, 1994 Proceedings

@en

P179

Lecture Notes in Computer Science

P31

proceedings

P356

10.1007/3-540-58691-1

http://www.w3.org/2001/XMLSchema#string

P577

1994-01-01T00:00:00Z

http://www.w3.org/2001/XMLSchema#dateTime

P98

Ming-Deh Huang

Leonard Adleman

Algorithmic Number Theory First International Symposium, ANTS-I, 1994 Proceedings

about

P1433

P1433

Algorithmic Number Theory First International Symposium, ANTS-I, 1994 Proceedings

description

name

type

label

prefLabel

P123

P1476

P179

P31

P356

P577

P98

P356

P123

P1476

P179

P31

P356

P577

P98